Hub-labelling Algorithm (Q39498739)
Jump to navigation
Jump to search
method that consumes fewer resources than the lookup table but is still extremely fast for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.
- Hub Labels
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hub-labelling Algorithm |
method that consumes fewer resources than the lookup table but is still extremely fast for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. |
|
Statements
Identifiers
Sitelinks
Wikipedia(1 entry)
- enwiki Hub labels