In a adjacent list Graph, find the shortest path between two Nodes by Dijkstra's algorithm.