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<TValue>,TValue> Factory and implementation of a dependency graph that can topologically sort its vertices.
interface	IAdjacencyList<TVertex extends IVertex<TValue>,TValue> 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<TValue>,TValue> This is a simple graph holding IVertex vertices and IEdge edges connecting them.
interface	ITopologicalSortStrategy<TVertex extends IVertex<TValue>,TValue> 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<TValue>,TValue> IGraph<TVertex,TValue>	DirectedAcyclicGraph.build(TVertex... vertices) Convenience method for easily constructing an instance of IGraph with the provided vertices.
static <TVertex extends IVertex<TValue>,TValue> IGraph<TVertex,TValue>	DirectedAcyclicGraph.create() Convenience method for easily constructing an instance of IGraph with an empty set of vertices.

Methods in jcommon.graph that return types with arguments of type IVertex

Set<IVertex>

ITopologicalSortInput.vertices() Returns the set of vertices that generated the input.

Methods in jcommon.graph with parameters of type IVertex

static <TVertex extends IVertex<TValue>,TValue> IGraph<TVertex,TValue>	DirectedAcyclicGraph.build(TVertex... vertices) Convenience method for easily constructing an instance of IGraph with the provided vertices.
boolean	ITopologicalSortInput.containsVertex(IVertex vertex) Returns a boolean indicating if the input contains a key for the provided vertex.
TValue	ITopologicalSortInput.get(IVertex vertex) Gets the output of an out neighbor vertex.
TValue	ITopologicalSortCallback.handle(TValue value, ITopologicalSortInput<TValue> input, IVertex<TValue> vertex, ITopologicalSortCoordinator coordinator) The callback that will be executed inside a thread other than the one invoking the sort.
void	ITopologicalSortErrorCallback.handleError(TValue value, Throwable t, IVertex<TValue> vertex, ITopologicalSortCoordinator coordinator) The callback that will be executed inside a thread pool other than the one invoking the sort.

Uses of IVertex in jcommon.graph.impl

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

class	AdjacencyList<TVertex extends IVertex<TValue>,TValue>
class	AdjacencyListPair<TVertex extends IVertex>
class	Edge<TVertex extends IVertex>
class	SimpleTopologicalSort<TVertex extends IVertex<TValue>,TValue> Implements ITopologicalSortStrategy for doing iterative and concurrent topological sorts.

Fields in jcommon.graph.impl declared as IVertex

TVertex	Edge.from The object we are connecting from.
TVertex	Edge.to The object we are connecting to.

Methods in jcommon.graph.impl that return types with arguments of type IVertex

Set<IVertex>

TopologicalSortInput.vertices()

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

boolean	TopologicalSortInput.containsVertex(IVertex vertex)
TValue	TopologicalSortInput.get(IVertex vertex)
int	AdjacencyList.indexOf(IVertex vertex)

Constructor parameters in jcommon.graph.impl with type arguments of type IVertex

TopologicalSortInput(boolean starting, Map<IVertex,TValue> inputs)
Instantiates a new instance of TopologicalSortInput.