Search for question
Question

7. (7 pts) Given a directed network represented as an adjacency class Graph, and a starting node

start, devise a method to efficiently find the shortest distance from start to all other nodes.

Definition:

Class Graph:

Fig: 1