Vertex Struct Reference
[Charm++ Load Balancing Framework]

#include <ckgraph.h>

Collaboration diagram for Vertex:

[legend]

Public Member Functions
	Vertex ()
	Vertex (int i, double cl, bool mig, int curpe, int newpe=-1)
int	getVertexId ()
double	getVertexLoad ()
int	getCurrentPe ()
int	getNewPe ()
void	setNewPe (int _newpe)
bool	isMigratable ()
Data Fields
std::vector< Edge >	sendToList
std::vector< Edge >	recvFromList
std::vector< McastSrc >	mcastToList
std::vector< McastDest >	mcastFromList
int	degree
int	next
int	adjListInd
Private Attributes
int	id
double	compLoad
bool	migratable
int	currPe
int	newPe
Friends
class	ObjGraph

---

Detailed Description

Definition at line 124 of file ckgraph.h.

---

Constructor & Destructor Documentation

Vertex::Vertex

(

)

[inline]

Definition at line 128 of file ckgraph.h.

Vertex::Vertex	(	int	i,
		double	cl,
		bool	mig,
		int	curpe,
		int	newpe = -1
	)			[inline]

Definition at line 129 of file ckgraph.h.

---

Member Function Documentation

int Vertex::getVertexId

(

)

[inline]

Definition at line 130 of file ckgraph.h.

References id.

Referenced by adjustgain(), adjustqueues(), BQueue::push(), RecursiveBiPart(), and BQueue::removeComplete().

double Vertex::getVertexLoad

(

)

[inline]

Definition at line 131 of file ckgraph.h.

References compLoad.

Referenced by ObjLoadGreater::operator()(), and RecursiveBiPart().

int Vertex::getCurrentPe

(

)

[inline]

Definition at line 132 of file ckgraph.h.

References currPe.

int Vertex::getNewPe

(

)

[inline]

Definition at line 133 of file ckgraph.h.

References newPe.

void Vertex::setNewPe

(

int

_newpe

)

[inline]

Definition at line 134 of file ckgraph.h.

References newPe.

bool Vertex::isMigratable

(

)

[inline]

Definition at line 135 of file ckgraph.h.

References migratable.

---

Friends And Related Function Documentation

friend class ObjGraph [friend]

Definition at line 125 of file ckgraph.h.

---

Field Documentation

std::vector<Edge> Vertex::sendToList

Definition at line 138 of file ckgraph.h.

Referenced by adjustqueues(), RecursiveBiPart(), and removeinSwap().

std::vector<Edge> Vertex::recvFromList

Definition at line 139 of file ckgraph.h.

Referenced by adjustqueues(), RecursiveBiPart(), and removeinSwap().

std::vector<McastSrc> Vertex::mcastToList

Definition at line 140 of file ckgraph.h.

std::vector<McastDest> Vertex::mcastFromList

Definition at line 141 of file ckgraph.h.

int Vertex::id [private]

Definition at line 144 of file ckgraph.h.

Referenced by getVertexId().

double Vertex::compLoad [private]

Definition at line 145 of file ckgraph.h.

Referenced by getVertexLoad().

bool Vertex::migratable [private]

Definition at line 146 of file ckgraph.h.

Referenced by isMigratable().

int Vertex::currPe [private]

Definition at line 147 of file ckgraph.h.

Referenced by getCurrentPe().

int Vertex::newPe [private]

Definition at line 148 of file ckgraph.h.

Referenced by getNewPe(), and setNewPe().

int Vertex::degree

Definition at line 9 of file graphdefs.h.

Referenced by addEdge(), addspEdge(), copyOut(), countDegrees(), diameter(), edgeExists(), initGraph(), printOut(), and sortAdjArrays().

int Vertex::next

Definition at line 10 of file graphdefs.h.

Referenced by addEdge(), addspEdge(), countDegrees(), fillAdjArray(), and initGraph().

int Vertex::adjListInd

Definition at line 11 of file graphdefs.h.

Referenced by addspEdge(), copyOut(), countDegrees(), diameter(), edgeExists(), fillAdjArray(), initGraph(), and sortAdjArrays().

---

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

• ck-ldb/ckgraph.h
• conv-ldb/graphdefs.h