This structure can be used to establish another directed graph over a node set of an existing one. This class uses the same Node type as the underlying graph, and each valid node of the original graph is valid in this arc set, therefore the node objects of the original graph can be used directly with this class. The node handling functions (id handling, observing, and iterators) works equivalently as in the original graph.
GR  The type of the graph which shares its node set with this class. Its interface must conform to the Digraph or Graph concept. 
This implementation is slightly faster than the ListArcSet
, because it uses continuous storage for arcs and it uses just singlelinked lists for enumerate outgoing and incoming arcs. Therefore the arcs cannot be erased from the arc sets.
This class fully conforms to the Digraph concept. It provides only linear time counting for nodes and arcs.
valid()
member function. #include <lemon/edge_set.h>
Inherits ArcSetExtender< Base >.
Public Member Functions  
SmartArcSet (const GR &graph)  
Constructor of the ArcSet. More...  
Arc  addArc (const Node &s, const Node &t) 
Add a new arc to the digraph. More...  
bool  valid () const 
Validity check. More...  

inline 
Constructor of the ArcSet.

inline 
Add a new arc to the digraph with source node s
and target node t
.

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.