given graph written sequence edges associated distance travel time start destination

[denver2020]

I got a given graph written sequence edges associated distance travel time start destination. I am given a graph written as sequence of edges with associated distance (travel time) as well as a start and destination node associated with a maximum allowed travel time. All edges can travel in both ways. Determine single shortest path between start and destination and print the route if distance of the path is less than or equal to than the maximum allowed travel time. Any suggestions are to which algorithm must be used here? Refer below link for more details.

https://www.chegg.com/homework-help/questions-and-answers/given-graph-written-sequence-edges-associated-distance-travel-time-well-start-destination--q29660371

[lastchance]

Continue on your existing thread, please.
http://www.cplusplus.com/forum/general/277574/#msg1198103