com.github.dexecutor.executor.graph

Interface Graph<T extends Comparable<T>,R>

Type Parameters:

T - Type of Node/Task ID

R - Type of Node/Task result

All Known Implementing Classes:

DefaultGraph

public interface Graph<T extends Comparable<T>,R>

Dependency would be constructed based on this APIs, Dexecutor uses this data structure to represent the dependencies between tasks

Author:

Nadeem Mohammad

Nested Class Summary

Nested Classes

Modifier and Type	Interface and Description
static class	Graph.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
static class	Graph.NodeStatus Represents node's execution status

Method Summary

Methods

Modifier and Type	Method and Description
void	addDependency(T evalFirstValue, T evalAfterValue) Should add the two nodes in the datastructure in such a way that evalFirstValue should be evaluated before evalAfterValue.
void	addIndependent(T nodeValue) Adds the given node to the datastructure whith out any dependency Nodes should be created only if it is not already added.
Collection<Graph.Node<T,R>>	allNodes() Returns all nodes in this graph
Set<Graph.Node<T,R>>	getInitialNodes() Returns the Set of nodes for which there is no incoming dependencies.
Set<Graph.Node<T,R>>	getLeafNodes() Retruns the set of nodes for which there is no outgoing dependencies.
int	size() Returns the total number of nodes in this graph

Method Detail

addDependency

void addDependency(T evalFirstValue,
                 T evalAfterValue)

Should add the two nodes in the datastructure in such a way that evalFirstValue should be evaluated before evalAfterValue. Nodes should be created only if it is not already added.

Parameters:

evalFirstValue -

evalAfterValue -

addIndependent

void addIndependent(T nodeValue)

Adds the given node to the datastructure whith out any dependency Nodes should be created only if it is not already added.

Parameters:

nodeValue -

getInitialNodes

Set<Graph.Node<T,R>> getInitialNodes()

Returns the Set of nodes for which there is no incoming dependencies.

Returns:

set of initial nodes

getLeafNodes

Set<Graph.Node<T,R>> getLeafNodes()

Retruns the set of nodes for which there is no outgoing dependencies.

Returns:

set of leaf nodes

allNodes

Collection<Graph.Node<T,R>> allNodes()

Returns all nodes in this graph

Returns:

all nodes in this graph

size

int size()

Returns the total number of nodes in this graph

Returns:

total number of nodes in this graph