Hub labels
id:
hub-labels-307-14135773
title:
Hub labels
text:
In computer science, hub labels or the hub-labelling algorithm is a speedup technique that consumes much 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. This method allows at the most with two SELECT statements and the analysis of two strings to compute the shortest path between two vertices of a graph.
For a graph that is oriented like a road graph, this technique requires
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Hub_labels
date created:
date modified:
2024-03-30T18:12:12Z
main entity:
{"identifier":"Q39498739","url":"https://www.wikidata.org/entity/Q39498739"}
image:
fields total:
13
integrity:
13