GrowBisection.cpp File Reference

GMetis -*- C++ -*-. More...

#include "GMetisConfig.h"
#include "MetisGraph.h"
#include "PMetis.h"
#include "defs.h"
#include <climits>
#include <vector>
#include <algorithm>

Functions
void	bisectionArray (GGraph *graph, GNode *nodes, int numNodes, int minWgtPart1, int maxWgtPart1, int *pwgts, int *visited, int *queue)
void	bisection (GGraph *graph, GNode *nodes, int numNodes, int minWgtPart1, int maxWgtPart1, int *pwgts, int *visited, int *queue)
void	randomBisection (MetisGraph *metisGraph, int *tpwgts, int coarsenTo)
void	growBisection (MetisGraph *metisGraph, int *tpwgts, int coarsenTo)
void	bisection (MetisGraph *metisGraph, int *tpwgts, int coarsenTo)
Variables
static const int	SMALL_NUM_ITER_PARTITION = 3
static const int	LARGE_NUM_ITER_PARTITION = 8

---

Detailed Description

GMetis -*- C++ -*-.

License

Galois, a framework to exploit amorphous data-parallelism in irregular programs.

Copyright (C) 2011, The University of Texas at Austin. All rights reserved. UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS SOFTWARE AND DOCUMENTATION, INCLUDING ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR ANY PARTICULAR PURPOSE, NON-INFRINGEMENT AND WARRANTIES OF PERFORMANCE, AND ANY WARRANTY THAT MIGHT OTHERWISE ARISE FROM COURSE OF DEALING OR USAGE OF TRADE. NO WARRANTY IS EITHER EXPRESS OR IMPLIED WITH RESPECT TO THE USE OF THE SOFTWARE OR DOCUMENTATION. Under no circumstances shall University be liable for incidental, special, indirect, direct or consequential damages or loss of profits, interruption of business, or related expenses which may arise from use of Software or Documentation, including but not limited to those resulting from defects in Software and/or Documentation, or loss or inaccuracy of data of any kind.

Author:

Xin Sui <xinsui@cs.utexas.edu>

---

Function Documentation

void bisection	(	MetisGraph *	metisGraph,
		int *	tpwgts,
		int	coarsenTo
	)

void bisection	(	GGraph *	graph,
		GNode *	nodes,
		int	numNodes,
		int	minWgtPart1,
		int	maxWgtPart1,
		int *	pwgts,
		int *	visited,
		int *	queue
	)

void bisectionArray	(	GGraph *	graph,
		GNode *	nodes,
		int	numNodes,
		int	minWgtPart1,
		int	maxWgtPart1,
		int *	pwgts,
		int *	visited,
		int *	queue
	)

void growBisection	(	MetisGraph *	metisGraph,
		int *	tpwgts,
		int	coarsenTo
	)

void randomBisection	(	MetisGraph *	metisGraph,
		int *	tpwgts,
		int	coarsenTo
	)

---

Variable Documentation

const int LARGE_NUM_ITER_PARTITION = 8 [static]

const int SMALL_NUM_ITER_PARTITION = 3 [static]