Sets of Edges
The data type edge_set can be used to store a subset of the edges
of graphs. Sets of Edges are specialized versions of
Sets.
Example of how a set
of edges can be used
Strengths
- all operations, except for
clear() , need constant time
clear() needs time proportional to the number of edges
in the set
- efficient iteration
over the set (proportional to number of edges in the set)
- edges appear at most once in the set
Disadvantages
- space proportional to number of edges in the corresponding graph
Tips
- Use Sets of Edges to store edges of a graph if you only need
set operations
- or you want to eliminate multiple copies of each edge.
- If you need more operations use Lists
of edges.
|
See also:
Sets
Sets of Nodes
Linear Lists
Manual Entries:
Page Sets of Edges
Iteration
|