Artificial problems in the research of graph partitioning using matrix values

This repo contains the binary files of the 4 artificial problems in the paper. Each subdirectory contains three binary files: Ai.bin: row pointer (denoted by row_ptr) in int32 of the CSR (compressed sparse row) format, length: N Aj.bin: colum indices in int32 of the CSR format, length: row_ptr[N] Av.bin: values in double precision (FP64) of the CSR format, length: row_ptr[N] The number of rows (N) of the 4 problems: checkerboard: N=16,000,000 circle: N=748,161 horizon: N=16,000,000 circulation: N=16,000,000 When accessing the binary data, users can first read the Ai.bin into the row_ptr array according to the value of N, and then read the other two binary files after knowing their lengths by row_ptr[N].