Algorithmic Solutions > LEDA > LEDA Guide > Graphs and Related Data Types > Sets of Nodes


Sets of Nodes

The data type node_set can be used to store a subset of the nodes of Graphs. Sets of Nodes are specialized versions of Sets.

Example of how a set of nodes can be used

Strengths

  • all operations, except for clear(), need only constant time
  • clear() needs time proportional to the number of nodes in the set
  • efficient iteration over the set (proportional to number of nodes in the set)
  • nodes appear at most once in a set of nodes

Disadvantages

  • space proportional to number of nodes in the corresponding graph

Tips

  • Use Sets of Nodes to store nodes of a graph if you only need set operations
  • or you want to eliminate multiple copies of each node.
  • If you need more operations use Lists of Nodes

See also:

Sets

Lists of Nodes

Linear Lists

Sets of Edges


Manual Entries:

Manual Page Sets of Nodes

Iteration




Please send any suggestions, comments or questions to leda@algorithmic-solutions.com
© Copyright 2001-2003, Algorithmic Solutions Software GmbH