This class describes the interface of iterable undirected bipartite graphs. It extends IterableGraphComponent with the core iterable interface of undirected bipartite graphs. This concept is part of the BpGraph concept.
#include <lemon/concepts/graph_components.h>
Public Types | |
Class Based Iteration | |
This interface provides iterator classes for red and blue nodes. | |
typedef GraphItemIt< BpGraph, RedNode > | RedNodeIt |
typedef GraphItemIt< BpGraph, BlueNode > | BlueNodeIt |
Public Member Functions | |
Base Iteration | |
This interface provides functions for iteration on red and blue nodes. | |
void | first (RedNode &) const |
Return the first red node. | |
void | next (RedNode &) const |
Return the next red node. | |
void | first (BlueNode &) const |
Return the first blue node. | |
void | next (BlueNode &) const |
Return the next blue node. |
typedef GraphItemIt<BpGraph, RedNode> RedNodeIt |
This iterator goes through each red node.
typedef GraphItemIt<BpGraph, BlueNode> BlueNodeIt |
This iterator goes through each blue node.
void first | ( | RedNode & | ) | const [inline] |
This function gives back the first red node in the iteration order.
void next | ( | RedNode & | ) | const [inline] |
This function gives back the next red node in the iteration order.
void first | ( | BlueNode & | ) | const [inline] |
This function gives back the first blue node in the iteration order.
void next | ( | BlueNode & | ) | const [inline] |
This function gives back the next blue node in the iteration order.