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|. |
||
|---|---|---|
| .. | ||
| cell_customizer.hpp | ||
| customizer_config.hpp | ||
| customizer.hpp | ||
| edge_based_graph.hpp | ||
| io.hpp | ||