Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | |||
courses:cs211:winter2011:journals:chen:chapter_6 [2011/04/06 16:39] โ [6.8 Shortest Paths in a Graph] zhongc | courses:cs211:winter2011:journals:chen:chapter_6 [2011/04/06 16:41] (current) โ [6.9 Shortest Paths and Distance Vector Protocols] zhongc | ||
---|---|---|---|
Line 347: | Line 347: | ||
remain constant during the execution of the algorithm. | remain constant during the execution of the algorithm. | ||
That is, we might get into a situation where there is infinite looping of mutual dependancy. | That is, we might get into a situation where there is infinite looping of mutual dependancy. | ||
+ | |||
+ | could fail if the other node is deleted. | ||