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|. |
||
---|---|---|
.. | ||
algorithm_datafacade.hpp | ||
contiguous_block_allocator.hpp | ||
contiguous_internalmem_datafacade.hpp | ||
datafacade_base.hpp | ||
process_memory_allocator.hpp | ||
shared_memory_allocator.hpp |