Definition
An instance S of the data type edgeset is a subset of the edges of a graph G . S is said to be valid for the edges of G .
#include < LEDA/graph/edge_set.h >
Creation
edge_set | S(const graph& G) | creates an instance S of type edgeset valid for all edges currently in graph G and initializes it to the empty set. |
Operations
Implementation
An edge set S for a graph G is implemented by a combination of a list L of edges and an edge array of list_items associating with each edge its position in L . All operations take constant time, except for clear which takes time O(S) . The space requirement is O(n) , where n is the number of edges of G .