1. What is a weighted graph? How do you define a shortest path in it?
2. Analyze the running time of your implementation of Program Strategy 10.12. Can you show that it is 0(e + n), where n is the number of vertices in G and e is the number of edges in G?