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|. |
||
|---|---|---|
| .. | ||
| io.hpp | ||
| serialization.hpp | ||
| shared_datatype.hpp | ||
| shared_memory.hpp | ||
| shared_monitor.hpp | ||
| storage_config.hpp | ||
| storage.hpp | ||