Package uk.ed.inf.graph.util

Interface Summary
IAdjacencyDataStructure  
IDirectedEdgeSet<N extends IDirectedNode<N,? extends IDirectedEdge<N,?>>,E extends IDirectedEdge<N,E>> A set designed to provide convenient access to directed edges.
IEdgeSet<N extends IBasicNode<N,? extends IBasicEdge<N,?>>,E extends IBasicEdge<N,E>> A set designed to provide convenient access to edges.
IFilterCriteria<F>  
IFilteredEdgeSet<N extends IBasicNode<N,? extends IBasicEdge<N,?>>,E extends IBasicEdge<N,E>>  
IFilteredNodeSet<N extends IBasicNode<N,? extends IBasicEdge<N,?>>,E extends IBasicEdge<N,E>>  
INodeEdgeFilterCriteria<N extends IBasicNode<N,? extends IBasicEdge<N,?>>,E extends IBasicEdge<N,E>>  
INodeFilterCriteria<N extends IBasicNode<N,? extends IBasicEdge<N,?>>,E extends IBasicEdge<N,E>>  
INodeSet<N extends IBasicNode<N,? extends IBasicEdge<N,?>>,E extends IBasicEdge<N,E>>  
 

Class Summary
IndexCounter Thread safe index counter.
SubgraphAlgorithms<N extends IBasicNode<N,? extends IBasicEdge<N,?>>,E extends IBasicEdge<N,E>>