Metis graph structure. More...
#include <metis_util.hpp>
Data Fields | |
idx_t * | nvtxs |
The number of vertices in the graph. | |
idx_t * | ncon |
idx_t * | xadj |
For each vertex it store the adjacency lost start for the vertex i. | |
idx_t * | adjncy |
For each vertex it store a list of all neighborhood vertex. | |
idx_t * | vwgt |
Array that store the weight for each vertex. | |
idx_t * | vsize |
Array of the vertex size, basically is the total communication amount. | |
idx_t * | adjwgt |
The weight of the edge. | |
idx_t * | nparts |
number of part to partition the graph | |
real_t * | tpwgts |
Desired weight for each partition (one for each constrain) | |
real_t * | ubvec |
For each partition load imbalance tollerated. | |
idx_t * | options |
Additional option for the graph partitioning. | |
idx_t * | objval |
return the total comunication cost for each partition | |
idx_t * | part |
Is a output vector containing the partition for each vertex. | |
idx_t* Metis_graph::ncon |
number of balancing constrains more practical, are the number of weights for each vertex PS even we you specify vwgt == NULL ncon must be set at leat to one
Definition at line 30 of file metis_util.hpp.