com.github.dexecutor.executor.graph

Class DefaultGraph<T extends Comparable<T>,R>

java.lang.Object

com.github.dexecutor.executor.graph.DefaultGraph<T,R>

Type Parameters:

T - Type of Node/Task ID

R - Type of Node/Task result

All Implemented Interfaces:

Graph<T,R>

public final class DefaultGraph<T extends Comparable<T>,R>
extends Object
implements Graph<T,R>

Default implementation of Graph

Author:

Nadeem Mohammad

Nested Class Summary

Nested classes/interfaces inherited from interface com.github.dexecutor.executor.graph.Graph

Graph.Node<T,R>, Graph.NodeStatus

Constructor Summary

Constructors

Constructor and Description
DefaultGraph()

Method Summary

Methods

Modifier and Type	Method and Description
void	addDependency(T evalFirstNode, T evalLaterNode) 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

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DefaultGraph

public DefaultGraph()

Method Detail

addIndependent

public void addIndependent(T nodeValue)

Description copied from interface: Graph

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

Specified by:

addIndependent in interface Graph<T extends Comparable<T>,R>

addDependency

public void addDependency(T evalFirstNode,
                 T evalLaterNode)

Description copied from interface: Graph

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.

Specified by:

addDependency in interface Graph<T extends Comparable<T>,R>

getInitialNodes

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

Description copied from interface: Graph

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

Specified by:

getInitialNodes in interface Graph<T extends Comparable<T>,R>

Returns:

set of initial nodes

size

public int size()

Description copied from interface: Graph

Returns the total number of nodes in this graph

Specified by:

size in interface Graph<T extends Comparable<T>,R>

Returns:

total number of nodes in this graph

allNodes

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

Description copied from interface: Graph

Returns all nodes in this graph

Specified by:

allNodes in interface Graph<T extends Comparable<T>,R>

Returns:

all nodes in this graph

getLeafNodes

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

Description copied from interface: Graph

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

Specified by:

getLeafNodes in interface Graph<T extends Comparable<T>,R>

Returns:

set of leaf nodes