Graph Class Reference
[Charm++ Load Balancing Framework, ParFUM Unstructured Mesh Framework]

#include <RecBisectBfLB.h>

Collaboration diagram for Graph:

[legend]

Public Member Functions
	Graph (int elems)
	~Graph ()
void	add (int elem1, int elem2)
int	elems (int elem)
void	toAdjList (int *&adjStart, int *&adjList)
	Graph (int elems)
	~Graph ()
void	add (int elem1, int elem2)
int	elems (int elem)
void	toAdjList (int *&adjStart, int *&adjList)
Data Fields
int	V
int	E
VertexRecord *	vertices
int *	edges
int	currentVertex
int	currentEdge
Private Attributes
int	nelems
NList *	nbrs
NList *	nbrs

---

Detailed Description

Definition at line 25 of file RecBisectBfLB.h.

---

Constructor & Destructor Documentation

Graph::~Graph

(

)

[inline]

Definition at line 62 of file partition.C.

References nbrs.

Graph::Graph

(

int

elems

)

Graph::~Graph

(

)

[inline]

Definition at line 65 of file partition.C.

References nbrs.

---

Member Function Documentation

int Graph::elems

(

int

elem

)

[inline]

Definition at line 64 of file partition.C.

References assert, NList::getnn(), nbrs, and nelems.

Referenced by mesh2graph_face(), and toAdjList().

Here is the call graph for this function:

Here is the caller graph for this function:

void Graph::add	(	int	elem1,
		int	elem2
	)

int Graph::elems

(

int

elem

)

[inline]

Definition at line 67 of file partition.C.

References assert, NList::getnn(), nbrs, and nelems.

Here is the call graph for this function:

void Graph::toAdjList	(	int *&	adjStart,
		int *&	adjList
	)

---

Field Documentation

int Graph::V

Definition at line 26 of file RecBisectBfLB.h.

Referenced by RecBisectBfLB::addToQ(), g_initGraph(), g_nextVertex(), g_printGraph(), generateRandomGraph(), RecBisectBfLB::partitionInTwo(), and RecBisectBfLB::work().

int Graph::E

Definition at line 26 of file RecBisectBfLB.h.

Referenced by g_initGraph(), g_printGraph(), and generateRandomGraph().

VertexRecord* Graph::vertices

Definition at line 27 of file RecBisectBfLB.h.

Referenced by g_addEdge(), g_finishVertex(), g_freeGraph(), g_getNeighbor(), g_initGraph(), g_nextVertex(), g_numNeighbors(), g_printGraph(), generateRandomGraph(), and graph_weightof().

int* Graph::edges

Definition at line 28 of file RecBisectBfLB.h.

Referenced by g_addEdge(), g_freeGraph(), g_getNeighbor(), g_initGraph(), g_printGraph(), and generateRandomGraph().

int Graph::currentVertex

Definition at line 29 of file RecBisectBfLB.h.

Referenced by g_addEdge(), g_finishVertex(), g_initGraph(), and g_nextVertex().

int Graph::currentEdge

Definition at line 30 of file RecBisectBfLB.h.

Referenced by g_addEdge(), g_finishVertex(), g_initGraph(), and g_nextVertex().

int Graph::nelems [private]

Definition at line 58 of file partition.C.

Referenced by add(), elems(), FEM_Mesh_partition(), Graph(), and toAdjList().

NList* Graph::nbrs [private]

Definition at line 59 of file partition.C.

Referenced by add(), elems(), Graph(), toAdjList(), and ~Graph().

NList* Graph::nbrs [private]

Definition at line 62 of file partition.C.

---

The documentation for this class was generated from the following files:

• ck-ldb/RecBisectBfLB.h
• libs/ck-libs/fem/partition.C
• libs/ck-libs/ParFUM/partition.C