Traverse Tree - Shortest path & Dijkstra's algorithm

I finally found a solution on how to traverse dependency tree using shortest path or Dijkstra's algorithm. The key to this solution is using spanning tree concept, i.e. not to care about either traverse upward or downward. I'll post my implementation here soon.