GR | The type of the graph which shares its node set with this class. Its interface must conform to the Digraph or Graph concept. |
ListArcSet
, because it uses continuous storage for arcs and it uses just single-linked lists for enumerate outgoing and incoming arcs. Therefore the arcs cannot be erased from the arc sets.
valid()
member function.#include <lemon/edge_set.h>
Inherits lemon::ArcSetExtender<SmartArcSetBase<GR> >.
Public Member Functions | |
SmartArcSet (const GR &graph) | |
Arc | addArc (const Node &s, const Node &t) |
Add a new arc to the digraph. | |
bool | valid () const |
Validity check. |
SmartArcSet | ( | const GR & | graph | ) | [inline] |
Constructor of the ArcSet.
Arc addArc | ( | const Node & | s, | |
const Node & | t | |||
) | [inline] |
Add a new arc to the digraph with source node s
and target node t
.
bool valid | ( | ) | const [inline] |
This functions gives back false if the ArcSet is invalidated. It occurs when a node in the underlying graph is erased and it is not isolated in the ArcSet.