What is a good quick pathfinding algorithm?

Question

What is a good path finding algorithm when you care the amount of time it takes but not how long the path is.

Also is there a faster algorithm if you don't care about the path at all but just want to check reachability.

(Is Flood Fill a good algorithm for this sort of stuff?)

Answer 1

What kind of graph are you finding a path on? Is it a grid? Is it a weight graph?

These things all matter.

Some algorithms that may be helpful include

• Breadth First Search
• Depth First Search
• Dijkstra's Algorithm
• A* (A Star)
• Floyd Warshall's Algorithm
• The Bellman Ford Algorithm