Positive reverse edge weights are different, the shortest path, with what method?-CodePudding

Home > other > Positive reverse edge weights are different, the shortest path, with what method?

Positive reverse edge weights are different, the shortest path, with what method?

Time：10-05

Set A city to B city, for example, there is A road, A city of altitude higher than B, if considering the uphill and downhill speed is different, the edge & lt; A, B> And edge & lt; B, A> Said at the time of weight is different also, namely & lt; A, B> And & lt; B, A> Should be two different sides, so in A picture of an arbitrary point can be obtained by A to the shortest time?
With the dijkstra algorithm is correct?

Page link：https//www.codepudding.com/other/51889.html

Prev:Android emulator wifi connection without the Internet

Next:How to use the opencv written after pour into image data byte type file?

Tags：

Data structures and algorithms

Links：
CodePudding