Content deleted Content added
Kaltenmeyer (talk | contribs) m →Combining two fragments: typo, typo(s) fixed: aformentioned → aforementioned |
→Assumptions: Fixed typo Tags: Mobile edit Mobile web edit |
||
Line 31:
* Each edge in the input graph has distinct finite weights. This assumption is not needed if there is a consistent method to break ties between edge weights.
* Each node initially knows the weight of each edge incident to that node.
* Initially, each node is in an inactive state. Each
* Messages can be transmitted independently in both directions on an edge and arrive after an unpredictable but finite delay, without error.
* Each edge delivers messages in [[FIFO (computing and electronics)|FIFO]] order.
| |||