C + + the shortest path problem has five cities, the five city eight road connecting each other, try to ask, I want to be from the city 1 to 5, try to help me work out how much is a shortest path

CodePudding user response:

Relatively rough is using the search algorithm, but the efficiency is low, can use dijkstra or Floyd algorithm