Uses of Interface
jcommon.graph.IVertex

Packages that use IVertex

jcommon.graph	Contains the standard API for interfacing with the jcommon-graph library.
jcommon.graph.impl	Contains implementations for key portions of the API.

Uses of IVertex in jcommon.graph

Classes in jcommon.graph with type parameters of type IVertex

class	DirectedAcyclicGraph<TVertex extends IVertex> Factory and implementation of a dependency graph that can topologically sort its vertices.
interface	IAdjacencyList<TVertex extends IVertex> An adjacency list is essentially an array of size n where A[i] is the list of out-neighbors of node i.
interface	IAdjacencyListPair<TVertex extends IVertex> Maintains a reference between a IVertex (IAdjacencyListPair.getVertex()) and its out-neighbors (IAdjacencyListPair.getOutNeighbors()).
interface	IEdge<TVertex extends IVertex> Represents a connection between two instances of IVertex of type TVertex.
interface	IGraph<TVertex extends IVertex> This is a simple graph holding IVertex vertices and IEdge edges connecting them.
interface	ITopologicalSortCallback<TVertex extends IVertex> A callback for when a vertex has been found in topological order.
interface	ITopologicalSortErrorCallback<TVertex extends IVertex> A callback for when an error has occurred during asynchronous processing.
interface	ITopologicalSortInput<TVertex extends IVertex> Aggregates the output of out neighbor vertices as input to a vertex being processed.
interface	ITopologicalSortStrategy<TVertex extends IVertex> Provides a strategy for implementing a topological sort of an IGraph.

Classes in jcommon.graph that implement IVertex

class	NumberVertex A representation of an IVertex instance using Numbers.
class	ObjectVertex A representation of an IVertex instance using Objects.
class	StringVertex A representation of an IVertex instance using Strings.

Fields in jcommon.graph declared as IVertex

static IVertex[]

IGraph.EMPTY_VERTICES Reference for an array of empty vertices that can be reused instead of having to allocate a new empty array on the heap every time.

Methods in jcommon.graph with type parameters of type IVertex

static <TVertex extends IVertex> IGraph<TVertex>	DirectedAcyclicGraph.build(TVertex... vertices) Convenience method for easily constructing an instance of IGraph with the provided vertices.
static <TVertex extends IVertex> IGraph<TVertex>	DirectedAcyclicGraph.create() Convenience method for easily constructing an instance of IGraph with an empty set of vertices.

Methods in jcommon.graph with parameters of type IVertex

static <TVertex extends IVertex> IGraph<TVertex>

DirectedAcyclicGraph.build(TVertex... vertices) Convenience method for easily constructing an instance of IGraph with the provided vertices.

Uses of IVertex in jcommon.graph.impl

Classes in jcommon.graph.impl with type parameters of type IVertex

class	AdjacencyList<TVertex extends IVertex>
class	AdjacencyListPair<TVertex extends IVertex>
class	Edge<TVertex extends IVertex>
class	SimpleTopologicalSort<TVertex extends IVertex> Please see the following for a description of this algorithm: http://www.cs.washington.edu/education/courses/cse373/02sp/lectures/cse373-21-TopoSort-4up.pdf
class	TopologicalSortInput<TVertex extends IVertex>

Fields in jcommon.graph.impl declared as IVertex

TVertex	Edge.from
TVertex	Edge.to

Methods in jcommon.graph.impl with parameters of type IVertex

int	AdjacencyList.indexOf(IVertex vertex)