|
SU2
|
#include <struct.h>
Public Attributes | |
| idx_t | nvtxs |
| idx_t | nedges |
| idx_t | ncon |
| idx_t * | xadj |
| idx_t * | vwgt |
| idx_t * | vsize |
| idx_t * | adjncy |
| idx_t * | adjwgt |
| idx_t * | tvwgt |
| real_t * | invtvwgt |
| int | free_xadj |
| int | free_vwgt |
| int | free_vsize |
| int | free_adjncy |
| int | free_adjwgt |
| idx_t * | label |
| idx_t * | cmap |
| idx_t | mincut |
| idx_t | minvol |
| idx_t * | where |
| idx_t * | pwgts |
| idx_t | nbnd |
| idx_t * | bndptr |
| idx_t * | bndind |
| idx_t * | id |
| idx_t * | ed |
| ckrinfo_t * | ckrinfo |
| vkrinfo_t * | vkrinfo |
| nrinfo_t * | nrinfo |
| struct graph_t * | coarser |
| struct graph_t * | finer |
| idx_t | gnvtxs |
| idx_t | nobj |
| real_t * | nvwgt |
| idx_t * | vtxdist |
| idx_t * | home |
| idx_t | free_vwgt |
| idx_t | free_adjwgt |
| idx_t | free_vsize |
| idx_t * | match |
| idx_t | nnbrs |
| idx_t | nrecv |
| idx_t | nsend |
| idx_t * | peind |
| idx_t * | sendptr |
| idx_t * | sendind |
| idx_t * | recvptr |
| idx_t * | recvind |
| idx_t * | imap |
| idx_t * | pexadj |
| idx_t * | peadjncy |
| idx_t * | peadjloc |
| idx_t | nlocal |
| idx_t * | lperm |
| idx_t * | rlens |
| idx_t * | slens |
| ikv_t * | rcand |
| idx_t * | lpwgts |
| idx_t * | gpwgts |
| real_t * | lnpwgts |
| real_t * | gnpwgts |
| idx_t | nsep |
| NRInfoType * | nrinfo |
| idx_t * | sepind |
| idx_t | lmincut |
| idx_t | level |
| idx_t | match_type |
| idx_t | edgewgt_type |
This data structure holds a graph
| ckrinfo_t * graph_t::ckrinfo |
The per-vertex cut-based refinement info
| idx_t* graph_t::imap |
The inverse map of local to global indices
| idx_t* graph_t::lperm |
lperm[0:nlocal] points to interior vertices, the rest are interface
| idx_t graph_t::nlocal |
Number of interior vertices
| idx_t graph_t::nnbrs |
The number of neighboring processors
| idx_t graph_t::nrecv |
The total number of remote vertices that need to be received. nrecv == recvptr[nnbrs]
| idx_t graph_t::nsend |
The total number of local vertices that need to be sent. This corresponds to the communication volume of each pe, in the sense that if a vertex needs to be sent multiple times, it is accounted in nsend. nsend == sendptr[nnbrs]
| idx_t * graph_t::peadjloc |
CSR format of the PEs each vertex is adjancent to along with the location in the sendind of the non-local adjancent vertices
| idx_t* graph_t::peind |
Array of size nnbrs storing the neighboring PEs
| idx_t * graph_t::recvind |
CSR format of the vertices that are received from each of the neighboring PEs.
| idx_t * graph_t::sendind |
CSR format of the vertices that are sent to each of the neighboring processors
| vkrinfo_t* graph_t::vkrinfo |
The per-vertex volume-based refinement info
1.8.12