Algorithm
DFS
Depth-First Search
Nodes
0
Edges
0
Distance
—
Legend
Visited
Active
Current
Unvisited
DFS
Depth-first
BFS
Breadth-first
Dijkstra
Shortest path
A*
Heuristic
A
B
1000000
Find Route