DAG Longest Path

From visone manual
Revision as of 08:14, 7 August 2015 by Nocaj (talk | contribs)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.


Each node gets the length of the longest directed path from any source in the directed acyclic graph (DAG). A source in DAG is a node which has only outgoing links.

If the graph has cycles, each strongly connected component is aggregated to one vertex which results in a DAG. Each vertex gets the longest directed path from any strongly connected component which has not incoming edges from any other strongly connected component.