LEMON 1.0.7
|
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, arcs and edges and functions to get the source and the target of the arcs and edges, conversion from arcs to edges and function to get both direction of the edges.
#include <lemon/concepts/graph_components.h>
Classes | |
class | Edge |
Undirected arc class of the graph. More... | |
Public Member Functions | |
bool | direction (const Arc &) const |
Returns the direction of the arc. | |
Arc | direct (const Edge &, bool) const |
Returns the directed arc. | |
Arc | direct (const Edge &, const Node &) const |
Returns the directed arc. | |
Arc | oppositeArc (const Arc &) const |
Returns the opposite arc. | |
Node | u (const Edge &) const |
Node | v (const Edge &) const |
bool direction | ( | const Arc & | ) | const [inline] |
Returns the direction of the arc. Each arc represents an edge with a direction. It gives back the direction.
Returns the directed arc from its direction and the represented edge.
Returns the directed arc from its source and the represented edge.
Returns the opposite arc. It is the arc representing the same edge and has opposite direction.