MyNode Class Reference

List of all members.

Classes
class	EdgeObjectIterator
Public Types
typedef list< MyEdge >	MyEdgeList
typedef MyEdgeList::iterator	MyEdgePtr
typedef MyEdgeList::const_iterator	MyConstEdgePtr
typedef EdgeObjectIterator < MyEdgePtr, map< MyNodeId, MyEdgePtr >::iterator >	MyEdgeIterator
typedef EdgeObjectIterator < MyConstEdgePtr, map < MyNodeId, MyConstEdgePtr > ::iterator >	MyConstEdgeIterator
typedef MyEdgeIterator	EdgeIterator
typedef MyConstEdgeIterator	ConstEdgeIterator
Public Member Functions
	MyNode (MyNodeId name)
	MyNode (const MyNode &copy)
void	copy (const MyNode &copy)
bool	operator== (const MyNode &rhs)
const MyNode &	operator= (const MyNode &rhs)
virtual void	clear ()
bool	hasType (string type)
void	addType (string type)
void	addTypes (set< string > types)
void	getTypes (set< string > &types) const
set< string >	getTypes () const
MyNodeId	getId () const
void	setStatus (string statusType)
void	clearStatus (string statusType)
bool	getStatus (string statusType)
bool	addFunction (string fn)
void	functions (vector< string > &fns) const
bool	isHidden () const
bool	isVisible () const
void	hide ()
void	unhide ()
MyNT	getWeight () const
void	setWeight (MyNT wt)
virtual MyEdgeIterator	incidentEdges ()
unsigned int	degree () const
	Return the number of edges incident on the node.
MyNT	getWeightedDegree () const
void	updateTotalEdgeWeight (MyNT oldWeight, MyNT newWeight)
unsigned int	numHiddenEdges () const
bool	isAdjacent (MyNodeId otherNode) const
bool	isAdjacent (const MyNode &otherNode) const
MyEdge *	getEdge (MyNodeId otherNode) const
bool	getEdgePtr (MyNodeId otherNode, MyEdgePtr &ptr)
bool	addEdge (MyNodeId otherNode, MyEdgePtr edgePtr)
MyEdgePtr	deleteEdge (MyNodeId otherNode)
void	hideEdge (MyNodeId other)
void	unhideEdge (MyNodeId other)
unsigned int	computeCommonNeighbours (const MyNode &other, set< MyNodeId > &common)

---

Member Function Documentation

unsigned int MyNode::computeCommonNeighbours	(	const MyNode &	other,
		set< MyNodeId > &	common
	)

Compute the set of nodes adjacent both to the invocant and to other.

Parameters:

[in]	other	an instance of MyNode.
[out]	common	a set that will contain the common neighbours.

Returns:

The number of common neighbours.

void MyNode::copy

(

const MyNode &

copy

)

MyEdge * MyNode::getEdge

(

MyNodeId

otherNode

)

const

Warning:

If you invoke this method for a pair of nodes that do not define an edge, the behaviour of the method is not defined.

MyNT MyNode::getWeightedDegree

(

)

const [inline]

Return the sum of the absolute values of the weights of the edges incident on the node.

---

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

• /home/poirel/src/c++/biorithm/libgraph/graph.h
• /home/poirel/src/c++/biorithm/libgraph/graph.C