At the end of this experiment, you will be able to:

• Understand what a shortest path is
• Perform Bellman-Ford single source shortest path on a graph
• Perform Dijkstra single source shortest path on a graph