BaseUGraphComponent Class Reference
Detailed Description
This class provides the minimal set of features needed for an undirected graph structure. All undirected graph concepts have to be conform to this base graph. It just provides types for nodes, edges and undirected edges and functions to get the source and the target of the edges and undirected edges, conversion from edges to undirected edges and function to get both direction of the undirected edges.#include <lemon/concepts/graph_components.h>
Classes | |
| class | UEdge |
| Undirected edge class of the graph. More... | |
Public Member Functions | |
| bool | direction (const Edge &) const |
| Returns the direction of the edge. | |
| Edge | direct (const UEdge &, bool) const |
| Returns the directed edge. | |
| Edge | direct (const UEdge &, const Node &) const |
| Returns the directed edge. | |
| Edge | oppositeEdge (const Edge &) const |
| Returns the opposite edge. | |
| Node | target (const UEdge &) const |
| Gives back the target node of an undirected edge. | |
| Node | source (const UEdge &) const |
| Gives back the source node of an undirected edge. | |
Member Function Documentation
| bool direction | ( | const Edge & | ) | const [inline] |
Returns the direction of the edge. Each edge represents an undirected edge with a direction. It gives back the direction.
Returns the directed edge from its direction and the represented undirected edge.
Returns the directed edge from its source and the represented undirected edge.
Returns the opposite edge. It is the edge representing the same undirected edge and has opposite direction.
Gives back the target node of an undirected edge. The name target is a little confusing because the undirected edge does not have target but it just means that one of the end node.
Gives back the source node of an undirected edge. The name source is a little confusing because the undirected edge does not have source but it just means that one of the end node.
