Re:A Discussion on Dijkstra's Algorithm
by nonconvergent on Thursday August 31, 2017 @12:19PM
(#15141364)
Yeah, it just explains Dijkstra's and not very well. A big point is that Dijkstra's like many MST producing algorithms gives you A minimum spanning tree, not necessarily THE minimum spanning tree.
And why does the price of 2 drinks to the same vertex change? Shouldn't all edges on a vertex share the same cost if the edges are only weighted by the cost of 2 drinks? If the edges were a combination of drink and travel costs, maybe this makes more sense (though you still wouldn't see a $0 edge).
And why does the price of 2 drinks to the same vertex change? Shouldn't all edges on a vertex share the same cost if the edges are only weighted by the cost of 2 drinks? If the edges were a combination of drink and travel costs, maybe this makes more sense (though you still wouldn't see a $0 edge).