Parallel Graph Partitioning and Sparse Matrix Ordering Tests
DescriptionParMetis 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.
119 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 17 hours ago.)
Upload new screenshots
Thanks for uploading more screenshots. Please note:
- Your screenshot should contain a typical scene when working with it.
- Take only a screenshot of the respective application and not of your whole desktop (unless the screenshot is meant for a window manager).
- Your screenshots must be in PNG format.
- You can upload multiple images at once.
- Your screenshot need to be approved by the moderators first. You will already see your screenshot but it will not be visible to others instantly. If moderators reject your upload you will get notified next time you visit this site (requires cookies).
- Images larger than 800x600 pixels will automatically be reduced. So don't try to capture too much detail in a screenshot. It may become unreadable. Shrink the applications window if possible.
- Screenshots are made public and can freely be used by anyone.
- Useful programs for making screenshots are shutter, ksnapshot (KDE), gimp, xwd or scrot. See the Debian wiki for more information on how to make screenshots under Debian.
- Please set your language to english so that everybody understands it. If you don't use english by default please start your application from a shell using after setting "export LANG=C".