metis_test
Tests for metis graph partitioning


metis_test, C++ programs which demonstrate the metis library, which can partition unstructured graphs or meshes, and compute fill-reducing reorderings of sparse matrices.

Licensing:

METIS is part of the METIS family of Multilevel Partitioning Algorithms. It was produced by the lab of George Karypis, who states

"It is our general policy to make these tools available to the research community for use in their own research and/or non-commercial applications."

For further information on licensing and permissions, refer to http://www.cs.umn.edu/~metis, the METIS home page.

Languages:

metis_test is available in a C version and a C++ version and a FORTRAN90 version.

-

Related Programs:

METIS, examples which illustrate the use of the METIS programs gpmetis, graphchk, m2gmetis, mpmetis, ndmetis, to partition the nodes of a graph or the elements of a mesh, for division among a number of parallel processes, or to reorder the variables in a sparse matrix to minimize fillin, by George Karypis.

METIS_GRAPH, a data directory which contains examples of the graph files used to describe a graph to the METIS family of programs.

METIS_MESH, a data directory which contains examples of the mesh files used to describe a finite element mesh to the METIS family of programs.

NEIGHBORS_TO_METIS_GRAPH, a FORTRAN90 program which reads information describing the adjacency relations in a tet mesh, and writes out essentially the same information, but in a format that METIS will accept.

Reference:

  1. George Karypis,
    METIS, a Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reduced Orderings of Sparse Matrices,
    Version 5.1.0.
  2. George Karypis, Vipin Kumar,
    A fast and high quality multilevel scheme for partitioning irregular graphs,
    SIAM Journal on Scientific Computing,
    Volume 20, Number 1, 1998, pages 359-392;

Source Code:


Last revised on 28 February 2017.