GR | The type of the graph which shares its node set with this class. Its interface must conform to the Digraph or Graph concept. |
ListEdgeSet
, because it uses continuous storage for edges and it uses just single-linked lists for enumerate incident edges. Therefore the edges cannot be erased from the edge sets.This class fully conforms to the Graph concept. It provides only linear time counting for nodes, edges and arcs.
valid()
member function. #include <lemon/edge_set.h>
Inherits lemon::EdgeSetExtender<SmartEdgeSetBase<GR> >.
Public Member Functions | |
SmartEdgeSet (const GR &graph) | |
Edge | addEdge (const Node &u, const Node &v) |
Add a new edge to the graph. | |
bool | valid () const |
Validity check. |
SmartEdgeSet | ( | const GR & | graph | ) | [inline] |
Constructor of the EdgeSet.
Edge addEdge | ( | const Node & | u, | |
const Node & | v | |||
) | [inline] |
Add a new edge to the graph with node u
and node v
endpoints.
bool valid | ( | ) | const [inline] |
This functions gives back false if the EdgeSet is invalidated. It occurs when a node in the underlying graph is erased and it is not isolated in the EdgeSet.