CODEWITHSUNDEEP
language-agnosticpath-findingflood-fill
Roman A. Taycher
Roman A. Taycher

Reputation: 19507

What is a good quick pathfinding algorithm?

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?)

Upvotes: 4

Views: 573

Answers (1)

Jamie Wong
Jamie Wong

Reputation: 18350

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

Upvotes: 3

Related Questions