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

#include "metislib.h"

Functions
void	ComputeSubDomainGraph (ctrl_t ctrl, graph_t graph)

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

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)

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

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

§ EliminateSubDomainEdges()

void EliminateSubDomainEdges	(	ctrl_t *	ctrl,
		graph_t *	graph
	)

This function computes the subdomain graph

§ 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

§ 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

§ PrintSubDomainGraph()

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

This function computes the subdomain graph. For deubuging purposes.

§ 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

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.