Research Article
Advancing Transportation Routing Decisions Using Riemannian Manifold Surfaces
Algorithm 4
Path finder and distance minimizer pseudocode.
| | Run Algorithm 3 | | (1) | fordo | | (2) | ifthen | | (3) | Assign and | | (4) | Split into and and into and | | (5) | Calculate and | | (6) | Define and | | (7) | | | (8) | end if | | (9) | ifthen | | (10) | Repeat steps 3–6 by replacing O with D | | (11) | | | (12) | end if | | (13) | ifthen | | (14) | Find the minimum and maximum of calculated in Algorithm 2 | | (15) | Calculate the total length of the geodesics for all using step 14 | | (16) | and are the minimum and maximum length geodesics for all that connect and | | (17) | end if | | (18) | end for |
|
