This graph enables efficient boundary edge scans at each level. Currenly this needs about |V|*|L| bytes of storage. We can optimize this when the highest boundary nodes ID is << |V|. |
||
---|---|---|
.. | ||
contractor | ||
customizer | ||
engine | ||
extractor | ||
osrm | ||
partition | ||
server | ||
storage | ||
updater | ||
util |