Interface | Description |
---|---|
Dag<T extends Comparable<T>,R> |
Dependency would be constructed based on this APIs, Dexecutor uses this data structure to represent the dependencies between tasks
|
Traversar<T extends Comparable<T>,R> |
Provides an API to Traverse a given graph
|
Validator<T extends Comparable<T>,R> |
This interface provides API to validate the graph before tasks execution
|
Class | Description |
---|---|
BaseTraversar<T extends Comparable<T>,R> | |
CyclicValidator<T extends Comparable<T>,R> |
A
Validator which does cyclic checks |
DefaultDag<T extends Comparable<T>,R> |
Default implementation of Graph
|
LevelOrderTraversar<T extends Comparable<T>,R> |
A Traversar which does level order traversal of the given graph
|
MergedLevelOrderTraversar<T extends Comparable<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
|
Copyright © 2016 Dexecutor. All rights reserved.