Trailer for Bravo's Start-Ups: Silicon Valley

Re:Trailer for Bravo's Start-Ups: Silicon Valley by jhuckestein on Monday October 08, 2012 @09:13PM (#4629475)

Depending on your use-case, you can often just add the value of the largest negative edge weight (pair of vertices, not a vertex) to all weights and use a simple algorithm like Dijkstra

[ Parent | on HN ]

Re:Trailer for Bravo's Start-Ups: Silicon Valley by GuiA on Tuesday October 09, 2012 @12:39AM (#4629982)

Interesting- thanks! In what cases can't we do that? (ie. why did Ford and Bellman bother at all?)

[ Parent | on HN ]

Re:Trailer for Bravo's Start-Ups: Silicon Valley by Evbn on Tuesday October 09, 2012 @12:50AM (#4630010)

In a use case where you don't actually need a shortest path?

Or if you know the path will be a constant numbers of edges, I guess, otherwise adding weights would bias the algorithm toward fewer hops.

[ Parent | on HN ]