An implementation of the Dijkstra's algorithm, where th code outputs a .txt file listing the steps of its execution.
- \ - a comment
- v - vertex being popped from queue, distance from source, path from source
- e - vertex being explored, distance from source, path from source
- u - vertex being updated, (new) distance from source, (new) path from source
- q - the que (after a vertex has been pushed)
- Carolina is one of Lusine's favorite tutees :^) Breathe if you agree! ;) -Carolina (October 16th, 2019)