|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectjcommon.graph.impl.TopologicalSortInput<TValue>
public class TopologicalSortInput<TValue>
ITopologicalSortInput| Constructor Summary | |
|---|---|
TopologicalSortInput(boolean starting,
Map<IVertex,TValue> inputs)
Instantiates a new instance of TopologicalSortInput. |
|
| Method Summary | |
|---|---|
boolean |
containsVertex(IVertex vertex)
Returns a boolean indicating if the input contains a key for the provided vertex. |
TValue |
first()
Retrieves the value of the first provided input. |
TValue |
get(IVertex vertex)
Gets the output of an out neighbor vertex. |
Iterable<TValue> |
inputs()
Generates an instance of Iterable that allows traversing the contents of the input. |
boolean |
isEmpty()
Determines if the input is empty. |
boolean |
isStart()
Indicates if this is a starting vertex (one with an in-degree of zero) we're processing. |
int |
size()
The size of the ITopologicalSortInput. |
String |
toString()
|
Set<IVertex> |
vertices()
Returns the set of vertices that generated the input. |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public TopologicalSortInput(boolean starting,
Map<IVertex,TValue> inputs)
TopologicalSortInput.
inputs - An instance of a Map that maps between a IVertex and the output from
processing it.| Method Detail |
|---|
public boolean isStart()
ITopologicalSortInput
isStart in interface ITopologicalSortInput<TValue>true if this represents a starting vertex (one with an in-degree of zero).ITopologicalSortInput.isStart()public boolean isEmpty()
ITopologicalSortInput
isEmpty in interface ITopologicalSortInput<TValue>true if the input is empty; false otherwise.ITopologicalSortInput.isEmpty()public TValue get(IVertex vertex)
ITopologicalSortInput
get in interface ITopologicalSortInput<TValue>vertex - The vertex whose output is desired.
ITopologicalSortInput.get(IVertex)public TValue first()
ITopologicalSortInputITopologicalSortInput.get(IVertex) method.
first in interface ITopologicalSortInput<TValue>null if there are no values in the input list.ITopologicalSortInput.first()public int size()
ITopologicalSortInputITopologicalSortInput. This is the same as the number of in-degree vertices in the IAdjacencyList.
size in interface ITopologicalSortInput<TValue>ITopologicalSortInput.ITopologicalSortInput.size()public boolean containsVertex(IVertex vertex)
ITopologicalSortInput
containsVertex in interface ITopologicalSortInput<TValue>vertex - The vertex for whom membership will be tested.
true if the provided vertex instance is a member of the input; false otherwise.ITopologicalSortInput.containsVertex(IVertex)public Iterable<TValue> inputs()
ITopologicalSortInputIterable that allows traversing the contents of the input.
inputs in interface ITopologicalSortInput<TValue>Iterable for traversing the contents of the input.ITopologicalSortInput.inputs()public Set<IVertex> vertices()
ITopologicalSortInput
vertices in interface ITopologicalSortInput<TValue>Set containing the set of vertices that generated the input.ITopologicalSortInput.vertices()public String toString()
toString in class Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||