DAG Longest Path: Difference between revisions
Jump to navigation
Jump to search
(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 ...") |
(No difference)
|
Revision as of 12:57, 10 June 2015
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.