Skip to content

Latest commit

 

History

History
6 lines (4 loc) · 321 Bytes

Readme.md

File metadata and controls

6 lines (4 loc) · 321 Bytes

Djikstra's Algorithm

In this program, I wrote a program in C++ that uses Djikstra's algorithm to find the shortest path between two nodes in a graph. For more information on Djikstra's algorithm, see Wikipedia's article.

This code compiles with G++.