#include <lemon/concepts/graph_components.h>
Public Types | |
Class based iteration | |
This interface provides functions for iteration on graph items | |
typedef GraphItemIt< Graph, Node > | ANodeIt |
typedef GraphItemIt< Graph, Node > | BNodeIt |
Public Member Functions | |
Base iteration | |
This interface provides functions for iteration on graph items | |
void | firstANode (Node &) const |
Gives back the first A-node in the iterating order. | |
void | nextANode (Node &) const |
void | firstBNode (Node &) const |
Gives back the first B-node in the iterating order. | |
void | nextBNode (Node &) const |
void | firstFromANode (UEdge &, const Node &) const |
void | nextFromANode (UEdge &) const |
void | firstFromBNode (UEdge &, const Node &) const |
void | nextFromBNode (UEdge &) const |
typedef GraphItemIt<Graph, Node> ANodeIt |
This iterator goes through each A-node.
typedef GraphItemIt<Graph, Node> BNodeIt |
This iterator goes through each B-node.
void firstANode | ( | Node & | ) | const [inline] |
Gives back the first undirected A-node in the iterating order.
void nextANode | ( | Node & | ) | const [inline] |
Gives back the next A-node in the iterating order.
void firstBNode | ( | Node & | ) | const [inline] |
Gives back the first undirected B-node in the iterating order.
void nextBNode | ( | Node & | ) | const [inline] |
Gives back the next B-node in the iterating order.
void firstFromANode | ( | UEdge & | , | |
const Node & | ||||
) | const [inline] |
Gives back the first of the undirected edges start from the given A-node.
void nextFromANode | ( | UEdge & | ) | const [inline] |
Gives back the next of the undirected edges start from the given A-node.
void firstFromBNode | ( | UEdge & | , | |
const Node & | ||||
) | const [inline] |
Gives back the first of the undirected edges start from the given B-node.
void nextFromBNode | ( | UEdge & | ) | const [inline] |
Gives back the next of the undirected edges start from the given B-node.