com.github.dexecutor.core.graph

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

Type Parameters:

T - Type of Node/Task ID

R - Type of Node/Task result

All Superinterfaces:

DependencyAware<T>

All Known Implementing Classes:

DefaultDag

public interface Dag<T extends Comparable<T>,R>
extends DependencyAware<T>

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

Author:

Nadeem Mohammad

Method Summary

Modifier and Type	Method and Description
Collection<Node<T,R>>	allNodes() Returns all nodes in this graph
Node<T,R>	get(T id) Returns the node with the given id
Set<Node<T,R>>	getInitialNodes() Returns the Set of nodes for which there is no incoming dependencies.
Set<Node<T,R>>	getLeafNodes() Retruns the set of nodes for which there is no outgoing dependencies.
Set<Node<T,R>>	getNonProcessedRootNodes()
int	size() Returns the total number of nodes in this graph

Methods inherited from interface com.github.dexecutor.core.graph.DependencyAware

addAsDependencyToAllInitialNodes, addAsDependentOnAllLeafNodes, addDependency, addIndependent

Method Detail

size

int size()

Returns the total number of nodes in this graph

Returns:

total number of nodes in this graph

get

Node<T,R> get(T id)

Returns the node with the given id

Parameters:

id - unique node id

Returns:

the @Node with the given id

getInitialNodes

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

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

Returns:

set of initial nodes

getLeafNodes

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

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

Returns:

set of leaf nodes

allNodes

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

Returns all nodes in this graph

Returns:

all nodes in this graph

getNonProcessedRootNodes

Set<Node<T,R>> getNonProcessedRootNodes()

Returns:

the root non processed nodes