Functions that deal with prunning the number of adjacent subdomains in kmetis. More...
#include "metislib.h"
Go to the source code of this file.
Functions | |
void | ComputeSubDomainGraph (ctrl_t *ctrl, graph_t *graph) |
void | EliminateSubDomainEdges (ctrl_t *ctrl, graph_t *graph) |
void | MoveGroupMinConnForCut (ctrl_t *ctrl, graph_t *graph, idx_t to, idx_t nind, idx_t *ind) |
void | MoveGroupMinConnForVol (ctrl_t *ctrl, graph_t *graph, idx_t to, idx_t nind, idx_t *ind, idx_t *vmarker, idx_t *pmarker, idx_t *modind) |
void | PrintSubDomainGraph (graph_t *graph, idx_t nparts, idx_t *where) |
void | UpdateEdgeSubDomainGraph (ctrl_t *ctrl, idx_t u, idx_t v, idx_t ewgt, idx_t *r_maxndoms) |
Functions that deal with prunning the number of adjacent subdomains in kmetis.
Definition in file minconn.c.
This function updates the weight of an edge in the subdomain graph by adding to it the value of ewgt. The update can either increase or decrease the weight of the subdomain edge based on the value of ewgt.
u | is the ID of one of the incident subdomains to the edge |
v | is the ID of the other incident subdomains to the edge |
ewgt | is the weight to be added to the subdomain edge |
nparts | is the number of subdomains |
r_maxndoms | is the maximum number of adjacent subdomains and is updated as necessary. The update is skipped if a NULL value is supplied. |