Question: The efficient algorithm has to use Dijkstras algorithm. Suppose we have an undirected graph G=(V, E) representing a set of cities and highways connecting them,
The efficient algorithm has to use Dijkstras algorithm.

Suppose we have an undirected graph G=(V, E) representing a set of cities and highways connecting them, with the weight of an edge representing the time needed to drive along it. We are given two cities set eV that currently have a long driving time between them, and are interested in building new roads to decrease this driving time as much as possible. We have a list P=((az, b),..., (ak, bk)) of possible roads we could build (each represented as a weighted edge as above), but we only have funding to build 2 of them. We want to find which 2 roads in P would reduce the driving time between s and t by as much as possible when added to G. (a) (50 pts.) Describe an efficient algorithm for this
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
