[Feature] Range partition (#1522)

* add reorder immutable graph.

* add python API.

* add reorder for csr.

* remove gk version.

* fix

* add cpp test.

* bug fixes

* fix tests.

* fix bugs and add check

* fix test.

* add omp.

* add comments.

* add coo reorder.

* fix a bug.

* handle reorder for different graph structues.

* fix lint.

* fix.

* add original ids.

* reshuffle nodes before metis partition.

* inner nodes are in contiguous Id range.

* reshuffle nodes/edges when partitioning.

* load partition return graph partition book.

* use inner_node/inner_edges

* add and test range partition book.

* count inner_edge correctly.

* fix lint.

* fix lint.

* fix lint.

* fix errors.

* fix errors.

* fix for TF.

* fix.

* fix.

* change docstring.

* support logical and.

* add comments.

* avoid copy.

* fix

* update docstring.

* fix a bug.

* add range search.

* fix

* fix a bug.

* add more tests.

* load graph partition book.

* support shared memory for range partition book.

* fix a bug.

* fix.

* fix lint.

* remove check

* fix test.

* remove num_nodes and num_edges

* fix lint.

* fix graph partition book.

* address comments.

* use makedirs.

* fix compile
Co-authored-by: xiang song(charlie.song) <classicxsong@gmail.com>
Co-authored-by: Chao Ma <mctt90@gmail.com>

tests/graph_index/test_subgraph.py

@@ -109,7 +109,7 @@ def test_node_subgraph_with_halo():
     inner_node = inner_node.asnumpy()
     inner_node_ids = np.nonzero(inner_node)[0]
     inner_node_ids = halo_subg.induced_nodes.tonumpy()[inner_node_ids]
-    assert np.all(inner_node_ids == np.sort(nodes))
+    assert np.all(np.sort(inner_node_ids) == np.sort(nodes))
 
     # Check if the inner edge labels are correct.
     inner_edge = inner_edge.asnumpy()