Uses of Interface
goldman.collection.set.Set

Packages that use Set
goldman.collection.set A set is an untagged algorithmically positioned collection of elements in which no two elements are equivalent. 
goldman.graph A graph represents general relationships between pairs of elements from among a set of elements. 
 

Uses of Set in goldman.collection.set
 

Classes in goldman.collection.set that implement Set
 class DirectAddressing<E>
          This data structure provides excellent performance, but O(|U|) space is required.
 class OpenAddressing<E>
          This data structure should also be considered when only a small fraction of the elements in the universe will be stored in the collection.
 class SeparateChaining<E>
          This data structure should be considered when only a small fraction of the elements in U will be stored in the collection.
 

Uses of Set in goldman.graph
 

Methods in goldman.graph that return Set
 Set<Set<V>> Graph.getConnectedComponents()
          Returns a set holding the set of vertices in each connected component of this graph.
 Set<Set<V>> AbstractGraph.getConnectedComponents()
           
 Set<Set<V>> Graph.getStronglyConnectedComponents()
          Returns a set holding the set of vertices in each strongly connected component of this graph.
 Set<Set<V>> AbstractGraph.getStronglyConnectedComponents()
           
 Set<E> WeightedGraph.kruskalMST()
          Uses Kruskal's minimum spanning tree to return a set of edges that form a minimum spanning tree for this graph.
 Set<E> AbstractWeightedGraph.kruskalMST()
           
 Set<E> WeightedGraph.primMST()
          Uses Prim's minimum spanning tree to return a set of edges that forms a minimum spanning tree for this graph.
 Set<E> AbstractWeightedGraph.primMST()
           
 

Methods in goldman.graph that return types with arguments of type Set
 Set<Set<V>> Graph.getConnectedComponents()
          Returns a set holding the set of vertices in each connected component of this graph.
 Set<Set<V>> AbstractGraph.getConnectedComponents()
           
 Set<Set<V>> Graph.getStronglyConnectedComponents()
          Returns a set holding the set of vertices in each strongly connected component of this graph.
 Set<Set<V>> AbstractGraph.getStronglyConnectedComponents()