1234

1243
1324
1324
1423
1432
2134

top sort or brute force if have 0 print out, otherwise print out vertice and go to
that list and repeat
common trick: run dijkstras from the end to achieve shortest distance from the end
to all other nodes **
running dijkstras from end point to find the shortest path from start to a given
middle edge that you have to visit to the destination.
hungary games
use reverse graph for this type of problem.

Implementation (lvl 2) review

TODO: Organize Eclipse and olympiads folders
graph representations and annotations
algorithms and the given annotations. (look at olympiads folder)

make template for ccc

https://www.lafitness.com/Pages/MembershipSignUpRate.aspx?id=kBYqoAfjtfX4xzMos7nHig
%3d%3d

abcbd