Require Psuedo code for the Travel
Budget: $10 – $30 USD
Need a pseudo code for Traffic congestion-related problem.
i. Write an adaptive algorithm to find shortest path of the provided network. In a provided network traffic congestion time is provided as edge weight whose values changes for every 15mins.
ii. Using the pseudo code that you produced in above, extend the functionality to include the following requirements. Produce an extended version of your pseudo code from R1.
1. generate new navigation requests (i.e., start and destination nodes),
2. revise existing journeys (i.e., change nodes on path for nodes not already visited, if necessary)
3. keep track of journey time for each vehicle that has completed its journey,
4. keep a running count of total journey time taken across all vehicles that have completed their journeys.
i. Write an adaptive algorithm to find shortest path of the provided network. In a provided network traffic congestion time is provided as edge weight whose values changes for every 15mins.
ii. Using the pseudo code that you produced in above, extend the functionality to include the following requirements. Produce an extended version of your pseudo code from R1.
1. generate new navigation requests (i.e., start and destination nodes),
2. revise existing journeys (i.e., change nodes on path for nodes not already visited, if necessary)
3. keep track of journey time for each vehicle that has completed its journey,
4. keep a running count of total journey time taken across all vehicles that have completed their journeys.