BaseBpUGraphComponent Class Reference

---

Detailed Description

This class provides the minimal set of features needed for an bipartite undirected graph structure. All bipartite undirected graph concepts have to be conform to this base graph. It just provides types for nodes, A-nodes, B-nodes, edges and undirected edges and functions to get the source and the target of the edges and undirected edges, conversion from edges to undirected edges and function to get both direction of the undirected edges. #include <lemon/concepts/graph_components.h>

Inheritance diagram for BaseBpUGraphComponent:

[legend]

List of all members.

Classes
class	ANode
	Helper class for A-nodes. More...
class	BNode
	Helper class for B-nodes. More...
Public Member Functions
bool	aNode (const Node &) const
bool	bNode (const Node &) const
Node	aNode (const UEdge &) const
Node	bNode (const UEdge &) const

---

Member Function Documentation

bool aNode

(

const Node &

)

const [inline]

Gives back true when the node is A-node.

bool bNode

(

const Node &

)

const [inline]

Gives back true when the node is B-node.

Node aNode

(

const UEdge &

)

const [inline]

Gives back the A-node of the undirected edge.

Node bNode

(

const UEdge &

)

const [inline]

Gives back the B-node of the undirected edge.