Metis graph structure. More...

Detailed Description

Metis graph structure.

Metis graph structure

Definition at line 21 of file metis_util.hpp.

#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.

Field Documentation

◆ adjncy

idx_t* Metis_graph::adjncy

For each vertex it store a list of all neighborhood vertex.

Definition at line 36 of file metis_util.hpp.

◆ adjwgt

idx_t* Metis_graph::adjwgt

The weight of the edge.

Definition at line 44 of file metis_util.hpp.

◆ ncon

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.

◆ nparts

idx_t* Metis_graph::nparts

number of part to partition the graph

Definition at line 46 of file metis_util.hpp.

◆ nvtxs

idx_t* Metis_graph::nvtxs

The number of vertices in the graph.

Definition at line 24 of file metis_util.hpp.

◆ objval

idx_t* Metis_graph::objval

return the total comunication cost for each partition

Definition at line 54 of file metis_util.hpp.

◆ options

idx_t* Metis_graph::options

Additional option for the graph partitioning.

Definition at line 52 of file metis_util.hpp.

◆ part

idx_t* Metis_graph::part

Is a output vector containing the partition for each vertex.

Definition at line 56 of file metis_util.hpp.

◆ tpwgts

real_t* Metis_graph::tpwgts

Desired weight for each partition (one for each constrain)

Definition at line 48 of file metis_util.hpp.

◆ ubvec

real_t* Metis_graph::ubvec

For each partition load imbalance tollerated.

Definition at line 50 of file metis_util.hpp.

◆ vsize

idx_t* Metis_graph::vsize

Array of the vertex size, basically is the total communication amount.

Definition at line 42 of file metis_util.hpp.

◆ vwgt

idx_t* Metis_graph::vwgt

Array that store the weight for each vertex.

Definition at line 39 of file metis_util.hpp.

◆ xadj

idx_t* Metis_graph::xadj

For each vertex it store the adjacency lost start for the vertex i.

Definition at line 33 of file metis_util.hpp.

The documentation for this struct was generated from the following file:

src/Decomposition/Distribution/metis_util.hpp