1. Implement a new class for graphs with weighted edges. Use the ordinary Graph class as a superclass for your implementation. After implementing the new class, provide two extra methods to implement...

1. Implement a new class for graphs with weighted edges. Use the ordinary Graph class as a superclass for your implementation. After implementing the new class, provide two extra methods to implement Dijkstra’s shortestdistance and shortest-path algorithms.