Parallel Graph Partitioning and Sparse Matrix Ordering Libs: Devel
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 files needed to develop programs using ParMetis.
This is ParMetis version 3.1. You can find the manual describing the
various routines in the directory 'Manual'. Also, the file called
INSTALL contains instructions on how to build and test ParMetis.
Please let me know of any problems that you have found with it.
parmetis (3.1-10) unstable; urgency=low
* debian/control,rules: support for all arch
-- Christophe Prud'homme <email@example.com> Fri, 04 Jan 2008 13:37:39 +0100
parmetis (3.1-9) unstable; urgency=low
* Bug fix: "parmetis_3.1-8+b1(unstable/amd64/xenophanes): FTBFS:
Doesn't search for mpi.h in right include path", thanks to Mar
Changes in version 3.1
- The mesh partitioning and dual creation routines have changed to support mixed
- The parmetis.h header file has been restructured and is now C++ friendly.
- Fortran bindings/renamings for various routines have been added.
- A number of bugs have been fixed.
- tpwgts are now respected for small graphs.
- fixed various divide by zero errors.
This is non-free software written by George Karypis et al. and copyrighted by
the Regents of the Uni
Browse inside libparmetis-dev_3.1-10_amd64.deb
Results 1 - 1 of 1Search over 15 billion files
© 1997-2017 FileWatcher.com