DAG Longest Path

From visone user support

You do not have permission to edit this page, for the following reason:

You can view and copy the source of this page:

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 node which results in a DAG. In this case, each vertex gets the longest directed path from any strongly connected component whose nodes do not have any incoming edge to a node of another strongly connected component.

Return to DAG Longest Path.