Revision as of 22:06, 7 November 2008 edit Lightbot (talk \| contribs) 791,863 edits Date audit per mosnum/overlink/Other ← Previous edit		Revision as of 11:59, 12 January 2009 edit undo 141.85.0.116 (talk) →Dijkstra-Scholten algorithm for acyclic directed graphs Next edit →
Line 19: * The program terminates when the root receives signals from all its children. == Dijkstra-Scholten algorithm for ~~acyclic~~ directed acyclic graphs == * The algorithm for a tree can be extended to acyclic directed graphs. We add an additional edge [[Deficit]] to each edge.

Dijkstra–Scholten algorithm: Difference between revisions