Edge sets. More...
#include <ogdf/basic/Graph_d.h>
Public Member Functions | |
EdgeSet ()=default | |
Creates an empty edge set associated with no graph. More... | |
EdgeSet (const Graph &graph) | |
Creates a new edge set associated with graph . More... | |
const RS::list_type & | edges () |
Returns a reference to the list of edges contained in this set. More... | |
const Graph & | graphOf () const |
Returns the associated graph. More... | |
Private Types | |
using | RS = RegisteredSet< internal::GraphEdgeRegistry, SupportFastSizeQuery > |
Edge sets.
Maintains a subset of edges contained in an associated graph.
Provides efficient operations for testing membership, iteration, insertion, and deletion of elements, as well as clearing the set.
SupportFastSizeQuery | Whether this set supports querying it's #size in constant instead of linear time (in the size). |
|
private |
Definition at line 93 of file GraphSets.h.
|
inlineexplicit |
Creates a new edge set associated with graph
.
Definition at line 99 of file GraphSets.h.
|
explicitdefault |
Creates an empty edge set associated with no graph.
|
inline |
Returns a reference to the list of edges contained in this set.
Definition at line 105 of file GraphSets.h.
|
inline |
Returns the associated graph.
Definition at line 108 of file GraphSets.h.