ckrinfo_t Struct Reference

#include <struct.h>

Collaboration diagram for ckrinfo_t:

[legend]

Data Fields
idx_t	id
idx_t	ed
idx_t	nnbrs
idx_t	inbr

---

Detailed Description

The following data structure stores holds information on degrees for k-way partition

Definition at line 34 of file struct.h.

---

Field Documentation

idx_t ckrinfo_t::id

The internal degree of a vertex (sum of weights)

Definition at line 35 of file struct.h.

Referenced by ComputeKWayBoundary(), ComputeKWayPartitionParams(), Greedy_KWayCutOptimize(), Greedy_McKWayCutOptimize(), MoveGroupContigForCut(), MoveGroupMinConnForCut(), and ProjectKWayPartition().

idx_t ckrinfo_t::ed

The total external degree of a vertex

Definition at line 36 of file struct.h.

Referenced by ComputeKWayBoundary(), ComputeKWayPartitionParams(), Greedy_KWayCutOptimize(), Greedy_McKWayCutOptimize(), and ProjectKWayPartition().

idx_t ckrinfo_t::nnbrs

The number of neighboring subdomains

Definition at line 37 of file struct.h.

Referenced by CheckRInfo(), ComputeKWayPartitionParams(), ComputeSubDomainGraph(), Greedy_KWayCutOptimize(), Greedy_McKWayCutOptimize(), MoveGroupContigForCut(), MoveGroupMinConnForCut(), and ProjectKWayPartition().

idx_t ckrinfo_t::inbr

The index in the cnbr_t array where the nnbrs list of neighbors is stored

Definition at line 38 of file struct.h.

Referenced by CheckRInfo(), ComputeKWayPartitionParams(), ComputeSubDomainGraph(), Greedy_KWayCutOptimize(), Greedy_McKWayCutOptimize(), MoveGroupContigForCut(), MoveGroupMinConnForCut(), and ProjectKWayPartition().

---

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

• libs/ck-libs/metis/libmetis/struct.h