dijkstra-pathfinder

This project is an implementation of Dijkstra's Pathfinding algorithm. Some examples of valid inputs can be found in ./testcases

Compiling

To compile this program run the command:

g++ dijsktra.cpp

This will output a.exe on Windows or on Linux a.out

Running the Program

To run the program with input data from a file, use the command:

a.exe < input.dat

or

./a.out < input.dat