Revision as of 19:17, 31 July 2011 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits some en-dashes ← Previous edit		Revision as of 19:28, 12 August 2011 edit undo TimBentley (talk \| contribs) Extended confirmed users 25,869 edits m Unlinked: Deficit Next edit →
Line 19: ==Dijkstra–Scholten algorithm for directed acyclic graphs== * The algorithm for a tree can be extended to acyclic directed graphs. We add an additional integer attribute [[Deficit]] to each edge. * On an incoming edge, Deficit will denote the difference between the number of messages received and the number of signals sent in reply. * When a node wishes to terminate, it waits until it has received signals from outgoing edges reducing their deficits to zero.

Dijkstra–Scholten algorithm: Difference between revisions