Introduction - If you have any usage issues, please Google them yourself
Multi Thread Implementation of Dijkstra s Shortest Path Algorithm All-to-all.
It reads a file in the format:
Edges Nodes
start end weight
Like this:
20 5
1 2 5
1 3 4
2 1 3
2 3 3