debian/0000755000000000000000000000000012172555047007176 5ustar debian/metis.manpages0000644000000000000000000000002412144243451012020 0ustar debian/manpages/*.1 debian/source/0000755000000000000000000000000012100604024010453 5ustar debian/source/format0000644000000000000000000000001412100604024011661 0ustar 3.0 (quilt) debian/patches/0000755000000000000000000000000012172552440010617 5ustar debian/patches/series0000644000000000000000000000004012144243451012024 0ustar 01_fix_installation_paths.patch debian/patches/01_fix_installation_paths.patch0000644000000000000000000000606512144250271016711 0ustar Description: fix installation paths for libraries Author: Anton Gladky Bug-Debian: http://bugs.debian.org/708045 Last-Update: 2013-05-13 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -1,8 +1,9 @@ cmake_minimum_required(VERSION 2.8) project(METIS) -set(GKLIB_PATH "GKlib" CACHE PATH "path to GKlib") +set(GKLIB_PATH "${CMAKE_SOURCE_DIR}/GKlib" CACHE PATH "path to GKlib") set(SHARED FALSE CACHE BOOL "build a shared library") +INCLUDE(GNUInstallDirs) if(MSVC) set(METIS_INSTALL FALSE) @@ -11,11 +12,11 @@ endif() # Configure libmetis library. -if(SHARED) - set(METIS_LIBRARY_TYPE SHARED) -else() - set(METIS_LIBRARY_TYPE STATIC) -endif(SHARED) +set(METIS_LIBRARY_TYPE SHARED) + +set(METIS_MAJOR_VERSION 5) +set(METIS_MINOR_VERSION 1) +set(METIS_PATCH_VERSION 0) include(${GKLIB_PATH}/GKlibSystem.cmake) # Add include directories. @@ -25,3 +26,10 @@ add_subdirectory("include") add_subdirectory("libmetis") add_subdirectory("programs") + +ENABLE_TESTING() +ADD_TEST(gpmetis "${CMAKE_BINARY_DIR}/programs/gpmetis" "${CMAKE_SOURCE_DIR}/graphs/4elt.graph" "20") +ADD_TEST(graphchk "${CMAKE_BINARY_DIR}/programs/graphchk" "${CMAKE_SOURCE_DIR}/graphs/4elt.graph") +ADD_TEST(m2gmetis "${CMAKE_BINARY_DIR}/programs/m2gmetis" "${CMAKE_SOURCE_DIR}/graphs/metis.mesh" "${CMAKE_SOURCE_DIR}/graphs/4elt.graph") +ADD_TEST(mpmetis "${CMAKE_BINARY_DIR}/programs/mpmetis" "${CMAKE_SOURCE_DIR}/graphs/metis.mesh" "10") +ADD_TEST(ndmetis "${CMAKE_BINARY_DIR}/programs/ndmetis" "${CMAKE_SOURCE_DIR}/graphs/4elt.graph") --- a/libmetis/CMakeLists.txt +++ b/libmetis/CMakeLists.txt @@ -4,13 +4,17 @@ file(GLOB metis_sources *.c) # Build libmetis. add_library(metis ${METIS_LIBRARY_TYPE} ${GKlib_sources} ${metis_sources}) +SET_TARGET_PROPERTIES(metis PROPERTIES + VERSION ${METIS_MAJOR_VERSION}.${METIS_MINOR_VERSION}.${METIS_PATCH_VERSION} + SOVERSION ${METIS_MAJOR_VERSION}) + if(UNIX) target_link_libraries(metis m) endif() if(METIS_INSTALL) install(TARGETS metis - LIBRARY DESTINATION lib - RUNTIME DESTINATION lib - ARCHIVE DESTINATION lib) + LIBRARY DESTINATION "${CMAKE_INSTALL_LIBDIR}" + RUNTIME DESTINATION "${CMAKE_INSTALL_LIBDIR}" + ARCHIVE DESTINATION "${CMAKE_INSTALL_LIBDIR}") endif() --- a/programs/CMakeLists.txt +++ b/programs/CMakeLists.txt @@ -15,7 +15,7 @@ if(METIS_INSTALL) install(TARGETS gpmetis ndmetis mpmetis m2gmetis graphchk cmpfillin - RUNTIME DESTINATION bin) + RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}) endif() # Try to find subversion revision. --- a/include/CMakeLists.txt +++ b/include/CMakeLists.txt @@ -1,3 +1,3 @@ if(METIS_INSTALL) - install(FILES metis.h DESTINATION include) + install(FILES metis.h DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}) endif() --- a/GKlib/CMakeLists.txt +++ b/GKlib/CMakeLists.txt @@ -8,6 +8,10 @@ include_directories(".") add_library(GKlib STATIC ${GKlib_sources}) +SET_TARGET_PROPERTIES(GKlib PROPERTIES + VERSION ${METIS_MAJOR_VERSION}.${METIS_MINOR_VERSION}.${METIS_PATCH_VERSION} + SOVERSION ${METIS_MAJOR_VERSION}) + if(UNIX) target_link_libraries(GKlib m) endif(UNIX) debian/README.source0000644000000000000000000000007212152120502011332 0ustar Removed manual/manual.pdf, as the source is not provided. debian/metis.install0000644000000000000000000000001012144243451011666 0ustar usr/bin debian/changelog0000644000000000000000000000064012172555046011047 0ustar metis (5.1.0.dfsg-2) unstable; urgency=low * [7327fa2] Fix typo in debian/copyright. * [a41e1e7] Do not use --parallel option in dh. (Closes: #717363) * [8d6adaa] Use canonical VCS. -- Anton Gladky Sat, 20 Jul 2013 20:42:20 +0200 metis (5.1.0.dfsg-1) unstable; urgency=low * Initial packaging. (Closes: #708045). -- Anton Gladky Mon, 13 May 2013 23:02:33 +0200 debian/libmetis-doc.examples0000644000000000000000000000001012144243451013270 0ustar graphs/ debian/libmetis5.install0000644000000000000000000000003012144243451012444 0ustar usr/lib/*/libmetis.so.* debian/rules0000755000000000000000000000015412172553031010245 0ustar #!/usr/bin/make -f %: dh $@ --buildsystem=cmake override_dh_strip: dh_strip --dbg-package=libmetis5-dbg debian/compat0000644000000000000000000000000212100604024010351 0ustar 9 debian/libmetis-dev.install0000644000000000000000000000004212144243451013136 0ustar usr/include usr/lib/*/libmetis.so debian/control0000644000000000000000000000632312172553767010614 0ustar Source: metis Section: libs Priority: optional Maintainer: Debian Science Maintainers Uploaders: Anton Gladky Homepage: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview Standards-Version: 3.9.4 Build-Depends: cmake, debhelper (>= 9) Vcs-Git: git://git.debian.org/git/debian-science/packages/metis.git Vcs-Browser: http://anonscm.debian.org/gitweb/?p=debian-science/packages/metis.git Package: libmetis-dev Section: libdevel Architecture: any Depends: libmetis5 (= ${binary:Version}), ${misc:Depends} Conflicts: libscotchmetis-dev Description: Serial Graph Partitioning and Fill-reducing Matrix Ordering. Header METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. The package contains a header-file. Package: libmetis-doc Section: doc Architecture: all Depends: ${misc:Depends} Description: Serial Graph Partitioning and Fill-reducing Matrix Ordering. Documentation METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. The package contains examples and documentation. Package: libmetis5 Architecture: any Multi-Arch: same Pre-Depends: ${misc:Pre-Depends} Depends: ${misc:Depends}, ${shlibs:Depends} Description: Serial Graph Partitioning and Fill-reducing Matrix Ordering METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. Package: metis Section: math Architecture: any Depends: ${misc:Depends}, ${shlibs:Depends}, libmetis5 (= ${binary:Version}) Description: Serial Graph Partitioning and Fill-reducing Matrix Ordering. Binaries METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. The package contains some binaries for graph analyzing. Package: libmetis5-dbg Architecture: any Section: debug Priority: extra Multi-Arch: same Pre-Depends: ${misc:Pre-Depends} Depends: ${misc:Depends}, ${shlibs:Depends}, libmetis5 (= ${binary:Version}) Description: Serial Graph Partitioning and Fill-reducing Matrix Ordering. Debugging symbols METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. The package contains debugging symbols. debian/copyright0000644000000000000000000000677112172551405011136 0ustar Format: http://www.debian.org/doc/packaging-manuals/copyright-format/1.0/ Upstream-Name: METIS Source: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview Files: * Copyright: 1995-2013, Regents of the University of Minnesota License: Apache License, Version 2.0 Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at . http://www.apache.org/licenses/LICENSE-2.0 . Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. . On Debian systems, the full text of the Apache License version 2.0 can be found in the file `/usr/share/common-licenses/Apache-2.0'. Files: GKlib/ms_inttypes.h GKlib/ms_stdint.h Copyright: 2006, Alexander Chemeris License: BSD-3-clause Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: . 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. . 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. . 3. The name of the author may be used to endorse or promote products derived from this software without specific prior written permission. . THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. Files: GKlib/getopt.c GKlib/gk_mksort.h Copyright: 1985-2006, Free Software Foundation, Inc. License: LGPL-2.1+ On Debian systems, the full text of the GNU LESSER GENERAL PUBLIC LICENSE version 2.1 can be found in the file `/usr/share/common-licenses/LGPL-2.1'. Files: GKlib/random.c Copyright: 2004, Makoto Matsumoto and Takuji Nishimura License: BSD-like THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. debian/manpages/0000755000000000000000000000000012172554702010766 5ustar debian/manpages/mpmetis.10000644000000000000000000001000212172554673012526 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.41.2. .TH MPMETIS "1" "May 2013" "mpmetis 5.1.0" "User Commands" .SH NAME mpmetis \- manual page for mpmetis 5.1.0 .SH SYNOPSIS .B mpmetis [\fIoptions\fR] \fImeshfile nparts\fR .SH DESCRIPTION .IP Required parameters .TP meshfile Stores the mesh to be partitioned. .TP nparts The number of partitions to split the mesh. .IP Optional parameters .HP \fB\-gtype\fR=\fIstring\fR .IP Specifies the graph to be used for computing the partitioning The possible values are: .TP dual \- Partition the dual graph of the mesh [default] .TP nodal \- Partition the nodal graph of the mesh .HP \fB\-ptype\fR=\fIstring\fR .IP Specifies the scheme to be used for computing the k\-way partitioning. The possible values are: .TP rb \- Recursive bisectioning .TP kway \- Direct k\-way partitioning [default] .HP \fB\-ctype\fR=\fIstring\fR .IP Specifies the scheme to be used to match the vertices of the graph during the coarsening. The possible values are: .TP rm \- Random matching .TP shem \- Sorted heavy\-edge matching [default] .HP \fB\-iptype\fR=\fIstring\fR [applies only when \fB\-ptype\fR=\fIrb]\fR .IP Specifies the scheme to be used to compute the initial partitioning of the graph. The possible values are: .TP grow \- Grow a bisection using a greedy strategy [default] .TP random \- Compute a bisection at random .HP \fB\-objtype\fR=\fIstring\fR [applies only when \fB\-ptype\fR=\fIkway]\fR .IP Specifies the objective that the partitioning routines will optimize. The possible values are: .TP cut \- Minimize the edgecut [default] .TP vol \- Minimize the total communication volume .HP \fB\-contig\fR [applies only when \fB\-ptype\fR=\fIkway]\fR .IP Specifies that the partitioning routines should try to produce partitions that are contiguous. Note that if the input graph is not connected this option is ignored. .HP \fB\-minconn\fR [applies only when \fB\-ptype\fR=\fIkway]\fR .IP Specifies that the partitioning routines should try to minimize the maximum degree of the subdomain graph, i.e., the graph in which each partition is a node, and edges connect subdomains with a shared interface. .HP \fB\-tpwgts\fR=\fIfilename\fR .IP Specifies the name of the file that stores the target weights for each partition. By default, all partitions are assumed to be of the same size. .HP \fB\-ufactor\fR=\fIint\fR .IP Specifies the maximum allowed load imbalance among the partitions. A value of x indicates that the allowed load imbalance is 1+x/1000. For ptype=rb, the load imbalance is measured as the ratio of the 2*max(left,right)/(left+right), where left and right are the sizes of the respective partitions at each bisection. For ptype=kway, the load imbalance is measured as the ratio of max_i(pwgts[i])/avgpwgt, where pwgts[i] is the weight of the ith partition and avgpwgt is the sum of the total vertex weights divided by the number of partitions requested. For ptype=rb, the default value is 1 (i.e., load imbalance of 1.001). For ptype=kway, the default value is 30 (i.e., load imbalance of 1.03). .HP \fB\-ncommon\fR=\fIint\fR .IP Specifies the common number of nodes that two elements must have in order to put an edge between them in the dual graph. Default is 1. .HP \fB\-niter\fR=\fIint\fR .IP Specifies the number of iterations for the refinement algorithms at each stage of the uncoarsening process. Default is 10. .HP \fB\-ncuts\fR=\fIint\fR .IP Specifies the number of different partitionings that it will compute. The final partitioning is the one that achieves the best edgecut or communication volume. Default is 1. .HP \fB\-nooutput\fR .IP Specifies that no partitioning file should be generated. .HP \fB\-seed\fR=\fIint\fR .IP Selects the seed of the random number generator. .HP \fB\-dbglvl\fR=\fIint\fR .IP Selects the dbglvl. .HP \fB\-help\fR .IP Prints this message. .SH "SEE ALSO" The full documentation for .B mpmetis is maintained as a Texinfo manual. If the .B info and .B mpmetis programs are properly installed at your site, the command .IP .B info mpmetis .PP should give you access to the complete manual. debian/manpages/ndmetis.10000644000000000000000000000624112144243451012511 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.41.2. .TH NDMETIS "1" "May 2013" "ndmetis 5.1.0" "User Commands" .SH NAME ndmetis \- manual page for ndmetis 5.1.0 .SH SYNOPSIS .B ndmetis [\fIoptions\fR] \fI\fR .SH DESCRIPTION .IP Required parameters .TP filename Stores the graph to be partitioned. .IP Optional parameters .HP \fB\-ctype\fR=\fIstring\fR .IP Specifies the scheme to be used to match the vertices of the graph during the coarsening. The possible values are: .TP rm \- Random matching .TP shem \- Sorted heavy\-edge matching [default] .HP \fB\-iptype\fR=\fIstring\fR [applies only when \fB\-ptype\fR=\fIrb]\fR .IP Specifies the scheme to be used to compute the initial bisection of the graph. The possible values are: .TP edge \- Separator from an edge cut .TP node \- Separator from a greedy node\-based strategy [default] .HP \fB\-rtype\fR=\fIstring\fR .IP Specifies the scheme to be used for refinement. The possible values are: .TP 1sided \- 1\-sided node\-based refinement [default] .TP 2sided \- 2\-sided node\-based refinement .HP \fB\-ufactor\fR=\fIint\fR .IP Specifies the maximum allowed load imbalance between the left and right partitions during each bisection. The load imbalanced is measured as the ratio of the 2*max(left,right)/(left+right), where left and right are the sizes of the respective partitions. A value of x indicates that the allowed load imbalance is 1+x/1000. Default is 200, indicating a load imbalance of 1.20. .HP \fB\-pfactor\fR=\fIint\fR .IP Specifies the minimum degree of the vertices that will be ordered last. If the specified value is x>0, then any vertices with a degree greater than 0.1*x*(average degree) are removed from the graph, an ordering of the rest of the vertices is computed, and an overall ordering is computed by ordering the removed vertices at the end of the overall ordering. Default value is 0, indicating that no vertices are removed .HP \fB\-no2hop\fR .IP Specifies that the coarsening will not perform any 2\-hop matchings when the standard matching fails to sufficiently contract the graph. .HP \fB\-nocompress\fR .IP Specifies that the graph should not be compressed by combining together vertices that have identical adjacency lists. .HP \fB\-ccorder\fR .IP Specifies if the connected components of the graph should first be identified and ordered separately. .HP \fB\-niter\fR=\fIint\fR .IP Specifies the maximum number of iterations for the refinement algorithms at each stage of the uncoarsening process. Default is 10. .HP \fB\-nseps\fR=\fIint\fR .IP Specifies the number of different separators that it will compute at each level of the nested dissection. The final separator that is used is the smallest one. Default is 1. .HP \fB\-nooutput\fR .IP Specifies that no ordering file should be generated. .HP \fB\-seed\fR=\fIint\fR .IP Selects the seed of the random number generator. .HP \fB\-dbglvl\fR=\fIint\fR .IP Selects the dbglvl. .HP \fB\-help\fR .IP Prints this message. .SH "SEE ALSO" The full documentation for .B ndmetis is maintained as a Texinfo manual. If the .B info and .B ndmetis programs are properly installed at your site, the command .IP .B info ndmetis .PP should give you access to the complete manual. debian/manpages/gpmetis.10000644000000000000000000001052112172554667012531 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.41.2. .TH GPMETIS "1" "May 2013" "gpmetis 5.1.0" "User Commands" .SH NAME gpmetis \- manual page for gpmetis 5.1.0 .SH SYNOPSIS .B gpmetis [\fIoptions\fR] \fIgraphfile nparts\fR .SH DESCRIPTION .IP Required parameters .TP graphfile Stores the graph to be partitioned. .TP nparts The number of partitions to split the graph. .IP Optional parameters .HP \fB\-ptype\fR=\fIstring\fR .IP Specifies the scheme to be used for computing the k\-way partitioning. The possible values are: .TP rb \- Recursive bisectioning .TP kway \- Direct k\-way partitioning [default] .HP \fB\-ctype\fR=\fIstring\fR .IP Specifies the scheme to be used to match the vertices of the graph during the coarsening. The possible values are: .TP rm \- Random matching .TP shem \- Sorted heavy\-edge matching [default] .HP \fB\-iptype\fR=\fIstring\fR [applies only when \fB\-ptype\fR=\fIrb]\fR .IP Specifies the scheme to be used to compute the initial partitioning of the graph. The possible values are: .TP grow \- Grow a bisection using a greedy scheme [default for ncon=1] .TP random \- Compute a bisection at random [default for ncon>1] .HP \fB\-objtype\fR=\fIstring\fR [applies only when \fB\-ptype\fR=\fIkway]\fR .IP Specifies the objective that the partitioning routines will optimize. The possible values are: .TP cut \- Minimize the edgecut [default] .TP vol \- Minimize the total communication volume .HP \fB\-no2hop\fR .IP Specifies that the coarsening will not perform any 2\-hop matchings when the standard matching fails to sufficiently contract the graph. .HP \fB\-contig\fR [applies only when \fB\-ptype\fR=\fIkway]\fR .IP Specifies that the partitioning routines should try to produce partitions that are contiguous. Note that if the input graph is not connected this option is ignored. .HP \fB\-minconn\fR [applies only when \fB\-ptype\fR=\fIkway]\fR .IP Specifies that the partitioning routines should try to minimize the maximum degree of the subdomain graph, i.e., the graph in which each partition is a node, and edges connect subdomains with a shared interface. .HP \fB\-tpwgts\fR=\fIfilename\fR .IP Specifies the name of the file that stores the target weights for each partition. By default, all partitions are assumed to be of the same size. .HP \fB\-ufactor\fR=\fIint\fR .IP Specifies the maximum allowed load imbalance among the partitions. A value of x indicates that the allowed load imbalance is 1+x/1000. For ptype=rb, the load imbalance is measured as the ratio of the 2*max(left,right)/(left+right), where left and right are the sizes of the respective partitions at each bisection. For ptype=kway, the load imbalance is measured as the ratio of max_i(pwgts[i])/avgpwgt, where pwgts[i] is the weight of the ith partition and avgpwgt is the sum of the total vertex weights divided by the number of partitions requested. For ptype=rb, the default value is 1 (i.e., load imbalance of 1.001). For ptype=kway, the default value is 30 (i.e., load imbalance of 1.03). .HP \fB\-ubvec\fR=\fIstring\fR .IP Applies only for multi\-constraint partitioning and specifies the per constraint allowed load imbalance among partitions. The required parameter corresponds to a space separated set of floating point numbers, one for each of the constraints. For example, for three constraints, the string can be "1.02 1.2 1.35" indicating a desired maximum load imbalance of 2%, 20%, and 35%, respectively. The load imbalance is defined in a way similar to ufactor. If supplied, this parameter takes priority over ufactor. .HP \fB\-niter\fR=\fIint\fR .IP Specifies the number of iterations for the refinement algorithms at each stage of the uncoarsening process. Default is 10. .HP \fB\-ncuts\fR=\fIint\fR .IP Specifies the number of different partitionings that it will compute. The final partitioning is the one that achieves the best edgecut or communication volume. Default is 1. .HP \fB\-nooutput\fR .IP Specifies that no partitioning file should be generated. .HP \fB\-seed\fR=\fIint\fR .IP Selects the seed of the random number generator. .HP \fB\-dbglvl\fR=\fIint\fR .IP Selects the dbglvl. .HP \fB\-help\fR .IP Prints this message. .SH "SEE ALSO" The full documentation for .B gpmetis is maintained as a Texinfo manual. If the .B info and .B gpmetis programs are properly installed at your site, the command .IP .B info gpmetis .PP should give you access to the complete manual. debian/manpages/m2gmetis.10000644000000000000000000000217312172554702012602 0ustar .\" DO NOT MODIFY THIS FILE! It was generated by help2man 1.41.2. .TH M2GMETIS "1" "May 2013" "m2gmetis 5.1.0" "User Commands" .SH NAME m2gmetis \- manual page for m2gmetis 5.1.0 .SH SYNOPSIS .B m2gmetis [\fIoptions\fR] \fI \fR .SH DESCRIPTION .IP Required parameters .TP meshfile Stores the input mesh. .TP graphfile The filename of the output graph. .IP Optional parameters .HP \fB\-gtype\fR=\fIstring\fR .IP Specifies the graph that will be generated. The possible values are: .TP dual \- Generate dual graph of the mesh [default] .TP nodal \- Generate the nodal graph of the mesh .HP \fB\-ncommon\fR=\fIint\fR [applies when gtype=dual] .IP Specifies the common number of nodes that two elements must have in order to put an edge between them in the dual graph. Default is 1. .HP \fB\-dbglvl\fR=\fIint\fR .IP Selects the dbglvl. .HP \fB\-help\fR .IP Prints this message. .SH "SEE ALSO" The full documentation for .B m2gmetis is maintained as a Texinfo manual. If the .B info and .B m2gmetis programs are properly installed at your site, the command .IP .B info m2gmetis .PP should give you access to the complete manual.