My Project
|
This class describes the interface of clearable undirected graphs. It extends BaseGraphComponent with a function for clearing the graph. This concept requires AlterableGraphComponent.
#include <lemon/concepts/graph_components.h>
Additional Inherited Members | |
![]() | |
typedef GraphItem< 'n'> | Node |
Node class of the digraph. More... | |
typedef GraphItem< 'a'> | Arc |
Arc class of the digraph. More... | |
![]() | |
void | clear () |
Erase all nodes and arcs from the digraph. More... | |
![]() | |
Node | u (const Edge &) const |
Return one end node of an edge. More... | |
Node | v (const Edge &) const |
Return the other end node of an edge. More... | |
Arc | direct (const Edge &, bool) const |
Return a directed arc related to an edge. More... | |
Arc | direct (const Edge &, const Node &) const |
Return a directed arc related to an edge. More... | |
bool | direction (const Arc &) const |
Return the direction of the arc. More... | |
Arc | oppositeArc (const Arc &) const |
Return the opposite arc. More... | |
![]() | |
Node | source (const Arc &) const |
Return the source node of an arc. More... | |
Node | target (const Arc &) const |
Return the target node of an arc. More... | |
Node | oppositeNode (const Node &, const Arc &) const |
Return the opposite node on the given arc. More... | |