QuizMe

* השאלה נוספה בתאריך: 12-04-2024

What is the problematic situation you described where Dijkstra's algorithm fails to converge?

		When each router has a message of different size to send to the same destination A, and they can choose clockwise or counterclockwise paths, the routing decisions will oscillate rather than converge.
		The algorithm always converges to the optimal solution regardless of the message sizes or path costs.