Efficient algorithms reduce computing plans between junctions to two problems: optimal energetic paths and standard shortest paths.
