Graph
Random
Tree
Comparison
Admissibility
Extra
Start Node
Finish Node
Set Graph
Change Ends
Algorithm
Dijkstra
Greedy
A*
Heuristic Function
Euclidean
Manhattan
Node to Expand
Next Step
Reset
Node ID
Evaluation
Save Graph
Load Graph