| Program | Source File | Description |
|---|---|---|
| test_NodeND | test_NodeND.f90 | Example of computing a fill-reducing ordering of a sparse matrix |
| test_PartGraphKway | test_PartGraphKway.f90 | Partition a graph specified by a matrix |
| test_PartGraphRecursive1 | test_PartGraphRecursive1.f90 | |
| test_PartGraphRecursive2 | test_PartGraphRecursive2.f90 | Partitioning a graph with non-equal number of edges per node. |
| test_PartMeshNodal1 | test_PartMeshNodal1.f90 | |
| test_PartMeshNodal2 | test_PartMeshNodal2.f90 | Example of partitioning a mesh composed of 4 quadrilaterals and 9 nodes based upon its nodal graph. |