Consider the following networks:
State the weight of the edge from S to Q.
Calculate the weight of the entire network.
State the weight of the edge connecting Q and S.
Calculate the weight of the entire network.
Calculate the weight of the following paths in this network:
Path Y-E-D
Path A-B-Z-X
Path X-C-A-B-Z
Find the weight of the following subnetworks, highlighted in green:
Calculate the weight of the following paths in this network:
Path from Y to X
Path from Z to C
Path from B to X
A group is organizing a tour for the elderly in a park, ending with a picnic. The given graph displays the map of the park:
Calculate the path which gives the shortest distance from the start of the park at vertex A, to the picnic area at vertex J.
The given map shows all possible routes in Mohamad's town. Mohamad travels from his home to his friend's house on a daily basis.
If Mohamad's house is vertex C, and his friend's house is vertex I, determine the shortest path between the two houses.
A grocery store is known for its fast deliveries across the town as shown in the following map:
If the store is at vertex A, and a delivery has to be made to vertex H, determine the shortest path the driver should take.
The police department receives a call about a robbery in progress at a grocery store. The given graph shows the map of the town:
If the nearest police car is located at vertex D and the grocery store is at vertex I, determine the shortest route the police should take.
A firefighting department received an emergency call about a house fire across the town represented in the following graph:
If the firefighting department is located at vertex L, and the house is at vertex A, determine the shortest route the firemen should take.
