Quick fix to pass it

The Dijkstra's algorithm doesn't require a path to every other vertex to a print partial results.

Finished project

The app implements both ways of storing graphs using STL structures and two algorithms:

• Prim's algorithm
• Dijkstra's algorithm

The last version supporting Linux TTvTT

The last version of the app that can be compiled on Linux.

I needed precise time measured and went for QueryPerformanceCounter which is Windows only as it was the easiest solution for me (used that in the first project from this course).

The implementation of algorithms does have few small bugs, so for running the final version on Linux the easiest way is to get rid of test() method. There's also a possibility to change QueryPerformanceCounter to something Linux- or multiplatform-friendly.