Find Shortest Path (Dijkstra)

Start node: D

End node: C

Shortest path and total: D-->7-->B-->3-->C, tot: 10

Enter Start/Destination Node