Skip to content

Latest commit

 

History

History
10 lines (8 loc) · 363 Bytes

README.md

File metadata and controls

10 lines (8 loc) · 363 Bytes

A tool to visualize two algorithms for finding the shortest path in a graph.

The visualization tool illustrates finding the shortest path in a graph in two ways: a brute-force algorithm that enumerates all possible paths and Dijkstra's shortest-path algorithm.

Visualizer

See the visualizer at https://zerny.github.io/shortest-path/index.html