FullBpUGraph Class Reference
[Graph Structures]

#include <lemon/full_graph.h>

Inherits BpUGraphExtender< lemon::BidirBpUGraphExtender< lemon::FullBpUGraphBase > >.

Inheritance diagram for FullBpUGraph:

Inheritance graph
[legend]
List of all members.

Detailed Description

This is a simple and fast bipartite undirected full graph implementation. It is completely static, so you can neither add nor delete either edges or nodes.

Author:
Balazs Dezso


Public Member Functions

void resize (int n, int m)
 Resize the graph.
int nodeNum () const
 Number of nodes.
int aNodeNum () const
 Number of A-nodes.
int bNodeNum () const
 Number of B-nodes.
int edgeNum () const
 Number of edges.
int uEdgeNum () const
 Number of undirected edges.
Node aNode (int index) const
 Returns the A-node with the given index.
Node bNode (int index) const
 Returns the B-node with the given index.
int aNodeIndex (const Node &node) const
 Returns the index of the A-node.
int bNodeIndex (const Node &node) const
 Returns the index of the B-node.
Edge edge (const Node &u, const Node &v) const
 Returns the edge connects the given nodes.
UEdge uEdge (const Node &u, const Node &v) const
 Returns the undirected edge connects the given nodes.


Member Function Documentation

void resize ( int  n,
int  m 
) [inline]

Resize the graph

Node aNode ( int  index  )  const [inline]

Returns the A-node with the given index. Because it is a static size graph the node's of the graph can be indiced by the range from 0 to aNodeNum()-1 and the index of the node can accessed by the aNodeIndex() member.

Node bNode ( int  index  )  const [inline]

Returns the B-node with the given index. Because it is a static size graph the node's of the graph can be indiced by the range from 0 to bNodeNum()-1 and the index of the node can accessed by the bNodeIndex() member.

int aNodeIndex ( const Node &  node  )  const [inline]

Returns the index of the A-node. Because it is a static size graph the node's of the graph can be indiced by the range from 0 to aNodeNum()-1 and the index of the node can accessed by the aNodeIndex() member.

int bNodeIndex ( const Node &  node  )  const [inline]

Returns the index of the B-node. Because it is a static size graph the node's of the graph can be indiced by the range from 0 to bNodeNum()-1 and the index of the node can accessed by the bNodeIndex() member.

Edge edge ( const Node &  u,
const Node &  v 
) const [inline]

Returns the edge connects the given nodes.

UEdge uEdge ( const Node &  u,
const Node &  v 
) const [inline]

Returns the undirected edge connects the given nodes.


The documentation for this class was generated from the following file:
Generated on Tue Oct 31 09:50:19 2006 for LEMON by  doxygen 1.5.1