Home >
other > How to solve there are levels of the shortest path problem?
How to solve there are levels of the shortest path problem?
Hypothesis from A starting point, A point as the source point, connect only 1 point B, level 1 point B can be connected to each other, between the level of point B can be connected to the second point C, the secondary point C can also be connected to each other, but the AC is unable to connect,,, can assume that all connection point distance is known,,, how to evaluate the shortest path?