Next: Dijkstra's Algorithm
Up: OORF: AN OBJECT-ORIENTED ROUTE
Shortest path algorithm is modeled as finding the shortest path between
two nodes in weighted and directed network with a node set
and an arc set as shown in Figure 1. Each arc
also has a length (or
In the route finding context, the network is
the road network. Nodes are the road junctions and arcs are road
segments. The length of each arc could be the distance or travelling
time between two adjacent junctions.
In this section, we review the two approaches. It is suggested that
neither of the approaches is not suitable for route finding.