Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests
Abstract
For a weighted digraph without loops V, the arc weights of which can be obtained from an undirected graph with loops P according to the rule vij=pij-pii, the properties are studied. An effective algorithm for constructing directed trees of minimum weight and an algorithm for constructing spanning directed forests of minimum weight are proposed.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.