Skip to main content
15 events
when toggle format what by license comment
Sep 22, 2017 at 5:02 history edited Graham CC BY-SA 3.0
PLEASE READ THIS BEFORE REJECTING - Community is removing SO documentation links according to guidelines in https://meta.stackoverflow.com/questions/356294/removing-documentation-reputation-archive-and-links?cb=1
May 23, 2017 at 12:09 history edited URL Rewriter Bot
replaced http://stackoverflow.com/ with https://stackoverflow.com/
Jan 26, 2017 at 18:17 comment added J0ANMM This video also explains a calculation example nicely.
Sep 14, 2016 at 7:35 audit First posts
Sep 14, 2016 at 7:36
Sep 2, 2016 at 1:24 comment added Tom Leys If your grid was far bigger you'd have a problem using Dijkstra's algorithm. That is, dijkstra (and BFS) both "flood" the graph from the start. They often explore nodes very far from the optimal path. The alternative is to use A* which is similar to dijkstra but also uses a heuristic to help focus on nodes that are likely to be close to the destination.
Sep 1, 2016 at 1:55 vote accept Daniel Oliveira
Aug 31, 2016 at 20:32 history edited Alex Filatov CC BY-SA 3.0
minor fix
Aug 31, 2016 at 20:24 history edited Alex Filatov CC BY-SA 3.0
deleted 14 characters in body
Aug 31, 2016 at 20:16 history edited Alex Filatov CC BY-SA 3.0
added algorithm description
Aug 31, 2016 at 20:01 history edited Alex Filatov CC BY-SA 3.0
added url on https://en.wikipedia.org/wiki/Shortest_path_problem#Algorithms
Aug 31, 2016 at 19:53 history edited Alex Filatov CC BY-SA 3.0
added Illustration of algorithm work
Aug 31, 2016 at 19:41 history edited Alex Filatov CC BY-SA 3.0
added 82 characters in body
Aug 31, 2016 at 18:37 history edited Alex Filatov CC BY-SA 3.0
added 280 characters in body
Aug 31, 2016 at 18:22 history edited Alex Filatov CC BY-SA 3.0
added 183 characters in body; added 150 characters in body; deleted 1 character in body
Aug 31, 2016 at 18:16 history answered Alex Filatov CC BY-SA 3.0