[ddp] libparmetis3.1 : Parallel Graph Partitioning and Sparse Matrix Ordering Shared Libs

[daily-debian-package at enix.org]

Hello,

Today, I'm happy to present you the Debian package libparmetis3.1,
which is part of the non-free/libs section, and maintained by Debian
Scientific Computing Team <pkg-scicomp-devel at lists.alioth.debian.org>.
Be careful, this package is in the non-free section !

This package contains : Parallel Graph Partitioning and Sparse Matrix
Ordering Shared Libs.

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 the ParMetis shared libraries.


Package homepage     :
 http://packages.debian.org/unstable/non-free/libs/libparmetis3.1

Package bug homepage :
 http://bugs.debian.org/libparmetis3.1

Package QA homepage  :
 http://packages.qa.debian.org/libparmetis3.1

Have fun with Debian packages !

-- 
Daily Debian package, by Thomas Petazzoni, thanks to Jérome Petazzoni
Daily-debian-package at the-doors.enix.org
http://the-doors.enix.org/cgi-bin/mailman/listinfo/daily-debian-package
http://thomas.enix.org/DebianPackageDay