DAG Longest Path

From visone manual

Revision as of 12:57, 10 June 2015 by Nocaj (talk | contribs) (Created page with "The input must be a directed acyclic graph (DAG). A source in DAG is a node which has only outgoing links. Each node gets the length of the longest directed path from any source ...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Retrieved from "https://visone.ethz.ch/wiki/index.php?title=DAG_Longest_Path&oldid=1620"