Functions
minconn.c File Reference

Functions that deal with prunning the number of adjacent subdomains in kmetis. More...

#include "metislib.h"
Include dependency graph for minconn.c:

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)
 

Detailed Description

Functions that deal with prunning the number of adjacent subdomains in kmetis.

Date
Started 7/15/98
Author
George
Copyright 1997-2009, Regents of the University of Minnesota
Version
Id
minconn.c 10513 2011-07-07 22:06:03Z karypis

Definition in file minconn.c.

Function Documentation

◆ ComputeSubDomainGraph()

void ComputeSubDomainGraph ( ctrl_t ctrl,
graph_t graph 
)

This function computes the subdomain graph storing the result in the pre-allocated worspace arrays

Definition at line 18 of file minconn.c.

◆ EliminateSubDomainEdges()

void EliminateSubDomainEdges ( ctrl_t ctrl,
graph_t graph 
)

This function computes the subdomain graph

Definition at line 192 of file minconn.c.

◆ MoveGroupMinConnForCut()

void MoveGroupMinConnForCut ( ctrl_t ctrl,
graph_t graph,
idx_t  to,
idx_t  nind,
idx_t ind 
)

This function moves a collection of vertices and updates their rinfo

Definition at line 477 of file minconn.c.

◆ MoveGroupMinConnForVol()

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 
)

This function moves a collection of vertices and updates their rinfo

Definition at line 561 of file minconn.c.

◆ PrintSubDomainGraph()

void PrintSubDomainGraph ( graph_t graph,
idx_t  nparts,
idx_t where 
)

This function computes the subdomain graph. For deubuging purposes.

Definition at line 683 of file minconn.c.

◆ UpdateEdgeSubDomainGraph()

void UpdateEdgeSubDomainGraph ( ctrl_t ctrl,
idx_t  u,
idx_t  v,
idx_t  ewgt,
idx_t r_maxndoms 
)

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.

Parameters
uis the ID of one of the incident subdomains to the edge
vis the ID of the other incident subdomains to the edge
ewgtis the weight to be added to the subdomain edge
npartsis the number of subdomains
r_maxndomsis the maximum number of adjacent subdomains and is updated as necessary. The update is skipped if a NULL value is supplied.

Definition at line 134 of file minconn.c.



gtsam
Author(s):
autogenerated on Fri Nov 1 2024 03:43:20