When loading the edges of a graph, there are two stages involved:
The first stage involves reading the edges into a temporary vector and acquiring information on the degrees of the vertices;
Then constructs the CSR using the degree information.
During the first stage, the edges are stored in the form of triplets, which can lead to a certain amount of memory expansion, so the use-mmap-vectoroption is provided, mmap_vector utilizes mmap to map files, supporting runtime swapping memory to disk.
Constructing the CSR involves random reads and writes, we offer the build-csr-in-mem option, which allows CSR to be built in-memory to avoid extensive disk random read and write operations.
When loading the edges of a graph, there are two stages involved:
During the first stage, the edges are stored in the form of triplets, which can lead to a certain amount of memory expansion, so the
use-mmap-vectoroption is provided, mmap_vector utilizes mmap to map files, supporting runtime swapping memory to disk.Constructing the CSR involves random reads and writes, we offer the
build-csr-in-memoption, which allows CSR to be built in-memory to avoid extensive disk random read and write operations.