This is a piece of code that is meant to partition a graph with ParMETIS. It is meant to serve as an example, but also as a tester.
The following are found in the file:
-
A function to dump the adjacency structure to files (like a distributed matrix).
-
A checker for the adjacency structure (out of bounds).
-
A generator of the distributed adjacency structure corresponding to a 1D Laplacian.
-
A generator of the distributed adjacency structure corresponding to a 2D Laplacian.
-
A driver that performs both the 1D and 2D Laplacian partitioning as a demo.
TO BE CONTINUED...
IN 2020/04/29