Content deleted Content added
No edit summary |
mNo edit summary |
||
Line 1:
[[File:Transit node routing intuition.gif|border|thumb|Multiple routes using the same access-nodes to long-distance road network.]]▼
In [[applied mathematics]], '''transit node routing''' can be used to speed up [[Shortest path routing|shortest-path routing]] by pre-computing connections between common access nodes to a sub-network relevant to long-distance travel<ref>{{Cite journal|last=Bast|first=H.|last2=Funke|first2=S.|last3=Sanders|first3=P.|last4=Schultes|first4=D.|date=2007-04-27|title=Fast Routing in Road Networks with Transit Nodes|url=http://dx.doi.org/10.1126/science.1137521|journal=Science|volume=316|issue=5824|pages=566–566|doi=10.1126/science.1137521|issn=0036-8075}}</ref>.
Line 5 ⟶ 4:
== Intuition ==
▲[[File:Transit node routing intuition.gif|border|thumb|Multiple routes using the same access-nodes to long-distance road network.]]
Long-distance travel usually involves driving along a specialised subset of the [[road network]] such as highways. This sub-network can only be entered by using sparsely distributed access-[[Node (computer science)|nodes]]. When compared to one another, multiple long-distance [[Path (graph theory)|routes]] starting at the same ___location always use the same small amount of access nodes close to the starting ___location to enter this network. In the same way, similar target locations are always reached by using the same access nodes close to them.
| |||