Implementation of hub labels for constrained shortest path.
Only directed graphs. The following attributes are mandatory: -Nodes: 'ID' as an integer. To use clustering, 'XY' as a coordinate of the form (x,y). -Edges: 'dist' as an integer, 'cost' as an integer
The format is a networkx graph.
See examples.py
Pending