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.
#include <lemon/concepts/graph_components.h>
Classes | |
class | BlueNode |
Class to represent blue nodes. More... | |
class | RedNode |
Class to represent red nodes. More... | |
Public Member Functions | |
bool | red (const Node &) const |
bool | blue (const Node &) const |
RedNode | redNode (const Edge &) const |
BlueNode | blueNode (const Edge &) const |
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. |
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.
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.
This function converts safely the node to red node object. If the node is not from the red partition, then it returns INVALID.
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.