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.

Pronunciation

Categories