Modifier and Type	Class and Description
pack-priv class	Vertex.DestinationCompare
pack-priv class	Vertex.SourceCompare

Modifier and Type	Field and Description
private T	data
private static final Edge<T extends ExplicitVertexID, U>[]	EMPTY_EDGE_LIST
private DirectedGraph<T extends ExplicitVertexID, U>	graph
pack-priv int	id
private Edge<T, U>[]	incoming
private int	incomingLength
private Edge<T, U>[]	outgoing
private int	outgoingLength

Access	Constructor and Description
public	Vertex(DirectedGraph<T extends ExplicitVertexID, U> graph, T data, int id)

Method Summary

Modifier and Type	Method and Description
public void	addEdgeTo(Vertex<T extends ExplicitVertexID, U> destination)
public void	addEdgeTo(Vertex<T extends ExplicitVertexID, U> destination, U type)
public void	addEdgeTo(T destination)
public void	addEdgeTo(T destination, U type)
protected void	addIncomingEdge(Edge<T, U> newEdge)
protected void	addOutgoingEdge(Edge<T, U> newEdge)
public int	compareTo(Vertex<T, U> the object to be compared. that) Implements java.lang.Comparable.compareTo. Compares this object with the specified object for order.
public T	getData()
private Edge<T, U>	getFirstEdge(Iterator<Edge<T, U>> iterator)
public int	getID()
public Edge<T, U>	getIncomingEdge()
public Edge<T, U>	getIncomingEdgeOfType(U type)
public Collection<Edge<T, U>>	getIncomingEdges()
public Iterable<Edge<T, U>>	getIncomingEdgesNotOfType(U type)
public Iterable<Edge<T, U>>	getIncomingEdgesOfType(U type)
public T	getIncomingSourceData()
public T	getIncomingSourceDataOfType(U type)
public Iterable<T>	getIncomingSourcesData()
public Iterable<T>	getIncomingSourcesDataNotOfType(U type)
public Iterable<T>	getIncomingSourcesDataOfType(U type)
public T	getOutgoingDestinationData()
public T	getOutgoingDestinationDataOfType(U type)
public Iterable<T>	getOutgoingDestinationsData()
public Iterable<T>	getOutgoingDestinationsDataNotOfType(Object type)
public Iterable<T>	getOutgoingDestinationsDataOfType(Object type)
public Edge<T, U>	getOutgoingEdge()
public Edge<T, U>	getOutgoingEdgeOfType(U type)
public Collection<Edge<T, U>>	getOutgoingEdges()
public Iterable<Edge<T, U>>	getOutgoingEdgesNotOfType(U type)
public Iterable<Edge<T, U>>	getOutgoingEdgesOfType(U type)
public int	inDegree()
public int	outDegree()
public void	removeAllEdges()
public void	removeAllIncomingEdges()
public void	removeAllOutgoingEdges()
public boolean	removeEdgeTo(Vertex<T extends ExplicitVertexID, U> destination)
protected void	removeIncomingEdge(Edge<T, U> edge)
protected void	removeOutgoingEdge(Edge<T, U> edge)
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll wait wait wait

Field Detail

data	back to summary
private T data

EMPTY_EDGE_LIST	back to summary
private static final Edge<T extends ExplicitVertexID, U>[] EMPTY_EDGE_LIST

graph	back to summary
private DirectedGraph<T extends ExplicitVertexID, U> graph

id	back to summary
pack-priv int id

incoming	back to summary
private Edge<T, U>[] incoming

incomingLength	back to summary
private int incomingLength

outgoing	back to summary
private Edge<T, U>[] outgoing

outgoingLength	back to summary
private int outgoingLength

Constructor Detail

Vertex	back to summary
public Vertex(DirectedGraph<T extends ExplicitVertexID, U> graph, T data, int id)

Method Detail

addEdgeTo	back to summary
public void addEdgeTo(Vertex<T extends ExplicitVertexID, U> destination)

addEdgeTo	back to summary
public void addEdgeTo(Vertex<T extends ExplicitVertexID, U> destination, U type)

addEdgeTo	back to summary
public void addEdgeTo(T destination)

addEdgeTo	back to summary
public void addEdgeTo(T destination, U type)

addIncomingEdge	back to summary
protected void addIncomingEdge(Edge<T, U> newEdge)

addOutgoingEdge	back to summary
protected void addOutgoingEdge(Edge<T, U> newEdge)

compareTo back to summary

compareTo	back to summary
public int compareTo(Vertex<T, U> that) Implements java.lang.Comparable.compareTo. Doc from java.lang.Comparable.compareTo. Compares this object with the specified object for order. Returns a negative integer, zero, or a positive integer as this object is less than, equal to, or greater than the specified object. The implementor must ensure `signum(x.compareTo(y)) == -signum(y.compareTo(x))` for all `x` and `y`. (This implies that `x.compareTo(y)` must throw an exception if and only if `y.compareTo(x)` throws an exception.) The implementor must also ensure that the relation is transitive: `(x.compareTo(y) > 0 && y.compareTo(z) > 0)` implies `x.compareTo(z) > 0`. Finally, the implementor must ensure that `x.compareTo(y)==0` implies that `signum(x.compareTo(z)) == signum(y.compareTo(z))`, for all `z`. Parameters that:Vertex<T, U> the object to be compared. Returns:int a negative integer, zero, or a positive integer as this object is less than, equal to, or greater than the specified object. Annotations @Override

public int compareTo(Vertex<T, U> that)

Implements java.lang.Comparable.compareTo.

Doc from java.lang.Comparable.compareTo.

Compares this object with the specified object for order. Returns a negative integer, zero, or a positive integer as this object is less than, equal to, or greater than the specified object.

The implementor must ensure signum(x.compareTo(y)) == -signum(y.compareTo(x)) for all x and y. (This implies that x.compareTo(y) must throw an exception if and only if y.compareTo(x) throws an exception.)

The implementor must also ensure that the relation is transitive: (x.compareTo(y) > 0 && y.compareTo(z) > 0) implies x.compareTo(z) > 0.

Finally, the implementor must ensure that x.compareTo(y)==0 implies that signum(x.compareTo(z)) == signum(y.compareTo(z)), for all z.

Parameters

that:Vertex<T, U>: the object to be compared.

Returns:int

a negative integer, zero, or a positive integer as this object is less than, equal to, or greater than the specified object.

Annotations

@Override

getData	back to summary
public T getData()

getFirstEdge	back to summary
private Edge<T, U> getFirstEdge(Iterator<Edge<T, U>> iterator)

getID	back to summary
public int getID()

getIncomingEdge	back to summary
public Edge<T, U> getIncomingEdge()

getIncomingEdgeOfType	back to summary
public Edge<T, U> getIncomingEdgeOfType(U type)

getIncomingEdges	back to summary
public Collection<Edge<T, U>> getIncomingEdges()

getIncomingEdgesNotOfType	back to summary
public Iterable<Edge<T, U>> getIncomingEdgesNotOfType(U type)

getIncomingEdgesOfType	back to summary
public Iterable<Edge<T, U>> getIncomingEdgesOfType(U type)

getIncomingSourceData	back to summary
public T getIncomingSourceData()

getIncomingSourceDataOfType	back to summary
public T getIncomingSourceDataOfType(U type)

getIncomingSourcesData	back to summary
public Iterable<T> getIncomingSourcesData()

getIncomingSourcesDataNotOfType	back to summary
public Iterable<T> getIncomingSourcesDataNotOfType(U type)

getIncomingSourcesDataOfType	back to summary
public Iterable<T> getIncomingSourcesDataOfType(U type)

getOutgoingDestinationData	back to summary
public T getOutgoingDestinationData()

getOutgoingDestinationDataOfType	back to summary
public T getOutgoingDestinationDataOfType(U type)

getOutgoingDestinationsData	back to summary
public Iterable<T> getOutgoingDestinationsData()

getOutgoingDestinationsDataNotOfType	back to summary
public Iterable<T> getOutgoingDestinationsDataNotOfType(Object type)

getOutgoingDestinationsDataOfType	back to summary
public Iterable<T> getOutgoingDestinationsDataOfType(Object type)

getOutgoingEdge	back to summary
public Edge<T, U> getOutgoingEdge()

getOutgoingEdgeOfType	back to summary
public Edge<T, U> getOutgoingEdgeOfType(U type)

getOutgoingEdges	back to summary
public Collection<Edge<T, U>> getOutgoingEdges()

getOutgoingEdgesNotOfType	back to summary
public Iterable<Edge<T, U>> getOutgoingEdgesNotOfType(U type)

getOutgoingEdgesOfType	back to summary
public Iterable<Edge<T, U>> getOutgoingEdgesOfType(U type)

inDegree	back to summary
public int inDegree()

outDegree	back to summary
public int outDegree()

removeAllEdges	back to summary
public void removeAllEdges()

removeAllIncomingEdges	back to summary
public void removeAllIncomingEdges()

removeAllOutgoingEdges	back to summary
public void removeAllOutgoingEdges()

removeEdgeTo	back to summary
public boolean removeEdgeTo(Vertex<T extends ExplicitVertexID, U> destination)

removeIncomingEdge	back to summary
protected void removeIncomingEdge(Edge<T, U> edge)

removeOutgoingEdge	back to summary
protected void removeOutgoingEdge(Edge<T, U> edge)

toString

back to summary

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object.

Returns:String

a string representation of the object

Annotations

@Override

org.jruby.dirgra back to summary

pack-priv Class Vertex.DestinationCompare

Class Inheritance

extends Object
implements Comparator<Edge<T extends ExplicitVertexID, U>>

java.lang.Object
org.jruby.dirgra.Vertex.DestinationCompare

All Implemented Interfaces

java.util.Comparator

Constructor Summary

Access	Constructor and Description
pack-priv	DestinationCompare()

Method Summary

Modifier and Type	Method and Description
public int	compare(Edge<T, U> the first object to be compared. o1, Edge<T, U> the second object to be compared. o2) Implements java.util.Comparator.compare. Compares its two arguments for order.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Constructor Detail

DestinationCompare	back to summary
pack-priv DestinationCompare()

Method Detail

compare back to summary

public int compare(Edge<T, U> o1, Edge<T, U> o2)

Implements java.util.Comparator.compare.

Doc from java.util.Comparator.compare.

Compares its two arguments for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.

The implementor must ensure that signum(compare(x, y)) == -signum(compare(y, x)) for all x and y. (This implies that compare(x, y) must throw an exception if and only if compare(y, x) throws an exception.)

The implementor must also ensure that the relation is transitive: ((compare(x, y)>0) && (compare(y, z)>0)) implies compare(x, z)>0.

Finally, the implementor must ensure that compare(x, y)==0 implies that signum(compare(x, z))==signum(compare(y, z)) for all z.

Parameters

o1:Edge<T, U>: the first object to be compared.
o2:Edge<T, U>: the second object to be compared.

Returns:int

a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.

Annotations

@Override

org.jruby.dirgra back to summary

pack-priv Class Vertex.SourceCompare

Class Inheritance

extends Object
implements Comparator<Edge<T extends ExplicitVertexID, U>>

java.lang.Object
org.jruby.dirgra.Vertex.SourceCompare

All Implemented Interfaces

java.util.Comparator

Constructor Summary

Access	Constructor and Description
pack-priv	SourceCompare()

Method Summary

Modifier and Type	Method and Description
public int	compare(Edge<T, U> the first object to be compared. o1, Edge<T, U> the second object to be compared. o2) Implements java.util.Comparator.compare. Compares its two arguments for order.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Constructor Detail

SourceCompare	back to summary
pack-priv SourceCompare()

Method Detail

compare back to summary

public int compare(Edge<T, U> o1, Edge<T, U> o2)

Implements java.util.Comparator.compare.

Doc from java.util.Comparator.compare.

Compares its two arguments for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.

The implementor must also ensure that the relation is transitive: ((compare(x, y)>0) && (compare(y, z)>0)) implies compare(x, z)>0.

Finally, the implementor must ensure that compare(x, y)==0 implies that signum(compare(x, z))==signum(compare(y, z)) for all z.

Parameters

o1:Edge<T, U>: the first object to be compared.
o2:Edge<T, U>: the second object to be compared.

Returns:int

a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.

Annotations

@Override

public Class Vertex<T extends ExplicitVertexID, U>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Class Vertex.DestinationCompare

Constructor Summary

Method Summary

Constructor Detail

Method Detail

pack-priv Class Vertex.SourceCompare

Constructor Summary

Method Summary

Constructor Detail

Method Detail