#include "metislib.h"

Include dependency graph for initpart.c:

Functions
void	GrowBisection (ctrl_t ctrl, graph_t graph, real_t *ntpwgts, idx_t niparts)

void	GrowBisectionNode (ctrl_t ctrl, graph_t graph, real_t *ntpwgts, idx_t niparts)

void	GrowBisectionNode2 (ctrl_t ctrl, graph_t graph, real_t *ntpwgts, idx_t niparts)

void	Init2WayPartition (ctrl_t ctrl, graph_t graph, real_t *ntpwgts, idx_t niparts)

void	InitSeparator (ctrl_t ctrl, graph_t graph, idx_t niparts)

void	McGrowBisection (ctrl_t ctrl, graph_t graph, real_t *ntpwgts, idx_t niparts)

void	McRandomBisection (ctrl_t ctrl, graph_t graph, real_t *ntpwgts, idx_t niparts)

void	RandomBisection (ctrl_t ctrl, graph_t graph, real_t *ntpwgts, idx_t niparts)

Function Documentation

◆ GrowBisection()

void GrowBisection	(	ctrl_t *	ctrl,
		graph_t *	graph,
		real_t *	ntpwgts,
		idx_t	niparts
	)

This function takes a graph and produces a bisection by using a region growing algorithm. The resulting bisection is refined using FM. The resulting partition is returned in graph->where.

Definition at line 189 of file initpart.c.

◆ GrowBisectionNode()

void GrowBisectionNode	(	ctrl_t *	ctrl,
		graph_t *	graph,
		real_t *	ntpwgts,
		idx_t	niparts
	)

Definition at line 433 of file initpart.c.

◆ GrowBisectionNode2()

void GrowBisectionNode2	(	ctrl_t *	ctrl,
		graph_t *	graph,
		real_t *	ntpwgts,
		idx_t	niparts
	)

Definition at line 570 of file initpart.c.

◆ Init2WayPartition()

void Init2WayPartition	(	ctrl_t *	ctrl,
		graph_t *	graph,
		real_t *	ntpwgts,
		idx_t	niparts
	)

This function computes the initial bisection of the coarsest graph

Definition at line 19 of file initpart.c.

◆ InitSeparator()

void InitSeparator	(	ctrl_t *	ctrl,
		graph_t *	graph,
		idx_t	niparts
	)

This function computes the initial separator of the coarsest graph

Definition at line 67 of file initpart.c.

◆ McGrowBisection()

void McGrowBisection	(	ctrl_t *	ctrl,
		graph_t *	graph,
		real_t *	ntpwgts,
		idx_t	niparts
	)

This function takes a multi-constraint graph and produces a bisection by using a region growing algorithm. The resulting partition is returned in graph->where.

Definition at line 385 of file initpart.c.

◆ McRandomBisection()

void McRandomBisection	(	ctrl_t *	ctrl,
		graph_t *	graph,
		real_t *	ntpwgts,
		idx_t	niparts
	)

This function takes a multi-constraint graph and computes a bisection by randomly assigning the vertices and then refining it. The resulting partition is returned in graph->where.

Definition at line 325 of file initpart.c.

◆ RandomBisection()

void RandomBisection	(	ctrl_t *	ctrl,
		graph_t *	graph,
		real_t *	ntpwgts,
		idx_t	niparts
	)

This function computes a bisection of a graph by randomly assigning the vertices followed by a bisection refinement. The resulting partition is returned in graph->where.

Definition at line 114 of file initpart.c.

Functions