| Interface | Description |
|---|---|
| Dag<T,R> |
Dependency would be constructed based on this APIs, Dexecutor uses this data structure to represent the dependencies between tasks
|
| DependencyAware<T> |
Implementors should be aware of the the dependencies between entities
|
| Traversar<T,R> |
Provides an API to Traverse a given graph
|
| TraversarAction<T,R> | |
| Validator<T,R> |
This interface provides API to validate the graph before tasks execution
|
| Class | Description |
|---|---|
| BaseTraversar<T,R> | |
| CyclicValidator<T,R> |
A
Validator which does cyclic checks |
| DefaultDag<T,R> |
Default implementation of Graph
|
| LevelOrderTraversar<T,R> |
A Traversar which does level order traversal of the given graph
|
| MergedLevelOrderTraversar<T,R> |
A Traversar which does level order traversal of the given graph and merges each level
|
| Node<T,R> |
A node representation in this graph, every node may have set of incoming edges and outgoing edges, a node is represented by unique value
|
| StringTraversarAction<T,R> |
Copyright © 2016–2018 Dexecutor. All rights reserved.