uva 10166 - shortest paths with dijkstra: many choices for the start
time essentially brute forced
uva 988 - enumerate num of paths in DAG: terminal nodes return 1 and the
others sum the ways of getting to the terminal nodes