My Project
List of all members | Public Member Functions
IDableBpGraphComponent< BAS > Class Template Reference

Detailed Description

template<typename BAS = BaseBpGraphComponent>
class lemon::concepts::IDableBpGraphComponent< BAS >

This class describes the interface of idable undirected bipartite graphs. It extends IDableGraphComponent with the core ID functions of undirected bipartite graphs. Beside the regular node ids, this class also provides ids within the the red and blue sets of the nodes. This concept is part of the BpGraph concept.

#include <lemon/concepts/graph_components.h>

+ Inheritance diagram for IDableBpGraphComponent< BAS >:

Public Member Functions

int id (const RedNode &) const
 Return a unique integer id for the given node in the red set. More...
 
int id (const BlueNode &) const
 Return a unique integer id for the given node in the blue set. More...
 
int maxRedId () const
 Return an integer greater or equal to the maximum node id in the red set. More...
 
int maxBlueId () const
 Return an integer greater or equal to the maximum node id in the blue set. More...
 
int id (const Edge &) const
 Return a unique integer id for the given edge. More...
 
- Public Member Functions inherited from IDableGraphComponent< BaseBpGraphComponent >
int id (const Edge &) const
 Return a unique integer id for the given edge. More...
 
Edge edgeFromId (int) const
 Return the edge by its unique id. More...
 
int maxEdgeId () const
 Return an integer greater or equal to the maximum edge id. More...
 
- Public Member Functions inherited from IDableDigraphComponent< BaseBpGraphComponent >
int id (const Node &) const
 Return a unique integer id for the given node. More...
 
int id (const Arc &) const
 Return a unique integer id for the given arc. More...
 
Node nodeFromId (int) const
 Return the node by its unique id. More...
 
Arc arcFromId (int) const
 Return the arc by its unique id. More...
 
int maxNodeId () const
 Return an integer greater or equal to the maximum node id. More...
 
int maxArcId () const
 Return an integer greater or equal to the maximum arc id. More...
 
- Public Member Functions inherited from BaseBpGraphComponent
bool red (const Node &) const
 Gives back true for red nodes. More...
 
bool blue (const Node &) const
 Gives back true for blue nodes. More...
 
RedNode redNode (const Edge &) const
 Gives back the red end node of the edge. More...
 
BlueNode blueNode (const Edge &) const
 Gives back the blue end node of the edge. More...
 
RedNode asRedNodeUnsafe (const Node &) const
 Converts the node to red node object. More...
 
BlueNode asBlueNodeUnsafe (const Node &) const
 Converts the node to blue node object. More...
 
RedNode asRedNode (const Node &) const
 Converts the node to red node object. More...
 
BlueNode asBlueNode (const Node &) const
 Converts the node to blue node object. More...
 
- Public Member Functions inherited from BaseGraphComponent
Node u (const Edge &) const
 Return one end node of an edge. More...
 
Node v (const Edge &) const
 Return the other end node of an edge. More...
 
Arc direct (const Edge &, bool) const
 Return a directed arc related to an edge. More...
 
Arc direct (const Edge &, const Node &) const
 Return a directed arc related to an edge. More...
 
bool direction (const Arc &) const
 Return the direction of the arc. More...
 
Arc oppositeArc (const Arc &) const
 Return the opposite arc. More...
 
- Public Member Functions inherited from BaseDigraphComponent
Node source (const Arc &) const
 Return the source node of an arc. More...
 
Node target (const Arc &) const
 Return the target node of an arc. More...
 
Node oppositeNode (const Node &, const Arc &) const
 Return the opposite node on the given arc. More...
 

Additional Inherited Members

- Public Types inherited from BaseDigraphComponent
typedef GraphItem< 'n'> Node
 Node class of the digraph. More...
 
typedef GraphItem< 'a'> Arc
 Arc class of the digraph. More...
 

Member Function Documentation

◆ id() [1/3]

int id ( const RedNode &  ) const
inline

Return a unique integer id for the given node in the red set.

◆ id() [2/3]

int id ( const BlueNode &  ) const
inline

Return a unique integer id for the given node in the blue set.

◆ maxRedId()

int maxRedId ( ) const
inline

Return an integer greater or equal to the maximum node id in the red set.

◆ maxBlueId()

int maxBlueId ( ) const
inline

Return an integer greater or equal to the maximum node id in the blue set.

◆ id() [3/3]

int id ( const Edge ) const
inline

This function returns a unique integer id for the given edge.