Package | Description |
---|---|
com.github.dexecutor.executor.graph |
Modifier and Type | Method and Description |
---|---|
Collection<Graph.Node<T,R>> |
Graph.allNodes()
Returns all nodes in this graph
|
Collection<Graph.Node<T,R>> |
DefaultGraph.allNodes() |
Set<Graph.Node<T,R>> |
Graph.Node.getInComingNodes() |
Set<Graph.Node<T,R>> |
Graph.getInitialNodes()
Returns the Set of nodes for which there is no incoming dependencies.
|
Set<Graph.Node<T,R>> |
DefaultGraph.getInitialNodes() |
Set<Graph.Node<T,R>> |
Graph.getLeafNodes()
Retruns the set of nodes for which there is no outgoing dependencies.
|
Set<Graph.Node<T,R>> |
DefaultGraph.getLeafNodes() |
Set<Graph.Node<T,R>> |
Graph.Node.getOutGoingNodes() |
Modifier and Type | Method and Description |
---|---|
void |
Graph.Node.addInComingNode(Graph.Node<T,R> node)
Add the given node, to the set of incoming nodes
|
void |
Graph.Node.addOutGoingNode(Graph.Node<T,R> node)
add the given to the set of out going nodes
|
Copyright © 2016 Dexecutor. All rights reserved.