Hold C to open the Radial Menu
Dijkstra

Simple algorithm that finds the shortest path through a weighted graph to a given node

Pros

  • Easy to implement
  • Finds the shortest path
  • Doesn't require a heuristic function

Cons

  • Doesn't work with negative weights
  • Can be slow for large graphs
A-star

Improved version of Dijkstra. Ranks nodes based on distance from target to make the most optimized path

Pros

  • Can be targeted for speed or accuracy
  • Still relatively simple to implement

Cons

  • Requires a well thought out heuristic function
  • Doesn't work with negative weights
Breadth-First Search

NOT IMPLEMENTED

Pros

Cons

Depth-First Search

NOT IMPLEMENTED

Pros

Cons

Bellman-Ford

NOT IMPLEMENTED

Pros

  • Works with negative weights
  • Finds the shortest path
  • Relatively easy to implement

Cons

  • Overall really slow
Greedy Best-First Search

NOT IMPLEMENTED

Pros

Cons

Floyd-Warshall Algorithm

NOT IMPLEMENTED

Pros

Cons

Johnson's Algorithm

NOT IMPLEMENTED

Pros

Cons

Bidirectional Search

NOT IMPLEMENTED

Pros

Cons

Jump Point Search

NOT IMPLEMENTED

Pros

Cons

Start
End
Obstacle
Erase
Algorithm
Play
Paint