The algorithm presented can be computed in the same order of time complexity as Dijkstra's shortest path algorithm, O(n{sup}2). Empirical evaluation demonstrates that the algorithm's performance is comparable to previous work on "simplest paths," with an average increase of path length of ...