|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
TValue - An instance of an Object that can be retrieved.public interface ITopologicalSortInput<TValue>
Aggregates the output of out neighbor vertices as input to a vertex being processed.
| 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. |
Set<IVertex> |
vertices()
Returns the set of vertices that generated the input. |
| Method Detail |
|---|
boolean isStart()
true if this represents a starting vertex (one with an in-degree of zero).boolean isEmpty()
true if the input is empty; false otherwise.TValue get(IVertex vertex)
vertex - The vertex whose output is desired.
TValue first()
get(IVertex) method.
null if there are no values in the input list.int size()
ITopologicalSortInput. This is the same as the number of in-degree vertices in the IAdjacencyList.
ITopologicalSortInput.boolean containsVertex(IVertex vertex)
vertex - The vertex for whom membership will be tested.
true if the provided vertex instance is a member of the input; false otherwise.Iterable<TValue> inputs()
Iterable that allows traversing the contents of the input.
Iterable for traversing the contents of the input.Set<IVertex> vertices()
Set containing the set of vertices that generated the input.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||