What is a good fast path search algorithm?

Question

What is a good path finding algorithm when you need the time it takes, but not the length of the path.

There is also a faster algorithm if you don't care about the path at all, but just want to check availability.

(Is there a flood Good algorithm for this kind of thing?)

Answer 1

What schedule do you find the way? Is this a grid? Is this a weight chart?

All of this matters.

Some algorithms that may be useful include

• First width search
• First Search Depth
• Dijkstra's Algorithm
• A * (star)
• Floyd Warsall's Algorithm
• Bellman Ford Algorithm