Uses of Interface
jcommon.graph.IGraph

Packages that use IGraph
jcommon.graph Contains the standard API for interfacing with the jcommon-graph library. 
 

Uses of IGraph in jcommon.graph
 

Classes in jcommon.graph that implement IGraph
 class DirectedAcyclicGraph<TVertex extends IVertex<TValue>,TValue,TProcessedValue>
          Factory and implementation of a dependency graph that can topologically sort its vertices.
 class NumberGraph<TNumber extends Number>
          Factory and implementation of a dependency graph that can topologically sort vertices that are Numbers.
 class ObjectGraph<TValue,TProcessedValue>
          Factory and implementation of a dependency graph that can topologically sort vertices that are Objects.
 class StringGraph
          Factory and implementation of a dependency graph that can topologically sort vertices that are Strings.
 

Methods in jcommon.graph that return IGraph
 IGraph<TVertex,TValue,TProcessedValue> DirectedAcyclicGraph.addEdge(TVertex from, TVertex to)
           
 IGraph<TVertex,TValue,TProcessedValue> IGraph.addEdge(TVertex from, TVertex to)
          Adds a new IEdge instance to this IGraph.
 IGraph<TVertex,TValue,TProcessedValue> DirectedAcyclicGraph.addVertex(TVertex vertex)
           
 IGraph<TVertex,TValue,TProcessedValue> IGraph.addVertex(TVertex vertex)
          Adds a new IVertex instance of TVertex to this IGraph.
static
<TVertex extends IVertex<TValue>,TValue,TProcessedValue>
IGraph<TVertex,TValue,TProcessedValue>
DirectedAcyclicGraph.build(TVertex... vertices)
          Convenience method for easily constructing an instance of IGraph with the provided vertices.
 IGraph<TVertex,TValue,TProcessedValue> DirectedAcyclicGraph.copy()
           
 IGraph<TVertex,TValue,TProcessedValue> IGraph.copy()
          More type-safe version of Object.clone().
static
<TVertex extends IVertex<TValue>,TValue,TProcessedValue>
IGraph<TVertex,TValue,TProcessedValue>
DirectedAcyclicGraph.create()
          Convenience method for easily constructing an instance of IGraph with an empty set of vertices.
 IGraph<TVertex,TValue,TProcessedValue> DirectedAcyclicGraph.removeEdge(TVertex from, TVertex to)
           
 IGraph<TVertex,TValue,TProcessedValue> IGraph.removeEdge(TVertex from, TVertex to)
          Removes an existing edge from this IGraph.
 IGraph<TVertex,TValue,TProcessedValue> DirectedAcyclicGraph.removeVertex(TVertex vertex)
           
 IGraph<TVertex,TValue,TProcessedValue> IGraph.removeVertex(TVertex vertex)
          Removes an IVertex instance of TVertex from this IGraph.
 



Copyright © 2012-2013. All Rights Reserved.