Database Reference
In-Depth Information
Route problems
The original problem that Euler set out to solve in 18
th
century Königsberg was in fact
arouteplanning/pathindingproblem.Today,manygraph applications leverage
the extraordinary capability of graphs and graph algorithms to calculate—as opposed
toindingwithtrialanderror—theoptimalroutebetweentwonodesonanetwork.
Inthefollowingdiagram,youwillindasimplerouteplanningexampleasagraph:
A simple route planning example between cities to choose roads versus highways
A very simple example will be from the domain of logistics. When trying to plan for
the best way to get a package from one city to another, one will need the following:
1.
A list of all routes available between the cities
2.
The most optimal of the available routes, which depends on various
parameters in the network, such as capacity, distance, cost, CO
2
exhaust,
speed, and so on
