Debian logoDebian Screenshots >


Parallel Graph Partitioning and Sparse Matrix Ordering Tests


ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and orders variables for minimal fill when using direct solvers for sparse matrices. It does all this in parallel, and also can efficiently re-partition a graph or mesh whose connectivity has changed.

This package contains programs which test the ParMetis libraries using files in the parmetis-doc package's examples directory.

Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.



39 other people were interested in this package here. The newest known version of this software is 4.0.3-4+b2 (Information last updated about 1 hour ago.)