Base skeleton class for undirected bipartite graphs.
More...
#include <lemon/concepts/graph_components.h>
|
| bool | red (const Node &) const |
| | Gives back true for red nodes.
|
| bool | blue (const Node &) const |
| | Gives back true for blue nodes.
|
| RedNode | redNode (const Edge &) const |
| | Gives back the red end node of the edge.
|
| BlueNode | blueNode (const Edge &) const |
| | Gives back the blue end node of the edge.
|
| RedNode | asRedNodeUnsafe (const Node &) const |
| | Converts the node to red node object.
|
| BlueNode | asBlueNodeUnsafe (const Node &) const |
| | Converts the node to blue node object.
|
| RedNode | asRedNode (const Node &) const |
| | Converts the node to red node object.
|
| BlueNode | asBlueNode (const Node &) const |
| | Converts the node to blue node object.
|
| Node | u (const Edge &) const |
| | Return one end node of an edge.
|
| Node | v (const Edge &) const |
| | Return the other end node of an edge.
|
| Arc | direct (const Edge &, bool) const |
| | Return a directed arc related to an edge.
|
| Arc | direct (const Edge &, const Node &) const |
| | Return a directed arc related to an edge.
|
| bool | direction (const Arc &) const |
| | Return the direction of the arc.
|
| Arc | oppositeArc (const Arc &) const |
| | Return the opposite arc.
|
| Node | source (const Arc &) const |
| | Return the source node of an arc.
|
| Node | target (const Arc &) const |
| | Return the target node of an arc.
|
| Node | oppositeNode (const Node &, const Arc &) const |
| | Return the opposite node on the given arc.
|
This class describes the base interface of undirected bipartite graph types. All bipartite graph concepts have to conform to this class. It extends the interface of BaseGraphComponent with an Edge type and functions to get the end nodes of edges, to convert from arcs to edges and to get both direction of edges.
◆ red()
| bool red |
( |
const Node & | | ) |
const |
|
inline |
Gives back true for red nodes.
◆ blue()
| bool blue |
( |
const Node & | | ) |
const |
|
inline |
Gives back true for blue nodes.
◆ redNode()
| RedNode redNode |
( |
const Edge & | | ) |
const |
|
inline |
Gives back the red end node of the edge.
◆ blueNode()
| BlueNode blueNode |
( |
const Edge & | | ) |
const |
|
inline |
Gives back the blue end node of the edge.
◆ asRedNodeUnsafe()
| RedNode asRedNodeUnsafe |
( |
const Node & | | ) |
const |
|
inline |
This function converts unsafely the node to red node object. It should be called only if the node is from the red partition or INVALID.
◆ asBlueNodeUnsafe()
| BlueNode asBlueNodeUnsafe |
( |
const Node & | | ) |
const |
|
inline |
This function converts unsafely the node to blue node object. It should be called only if the node is from the red partition or INVALID.
◆ asRedNode()
| RedNode asRedNode |
( |
const Node & | | ) |
const |
|
inline |
This function converts safely the node to red node object. If the node is not from the red partition, then it returns INVALID.
◆ asBlueNode()
| BlueNode asBlueNode |
( |
const Node & | | ) |
const |
|
inline |
This function converts unsafely the node to blue node object. If the node is not from the blue partition, then it returns INVALID.