Pathium

Calculating shortest paths...

1/11

Show Cell Weights:

A* Search Heuristic:

Euclidean Distance

Manhattan Distance

Run Statistics

Best Algorithm:

BFS

DFS

Dijkstra

A* Search

Greedy

Bellman-Ford

Dijkstra

BFS

DFS

A* Search

Greedy

Bellman-Ford

Graph:

Standard

Maze

Custom

Recursive Division

Random Walls

DFS

Environment:

Road Network [+ve]

Elevated Terrain [±]

Flat Terrain [0]

Steps: 0

Speed:

Average

Fast

Slow