org.testng.internal

Class Graph<T>

java.lang.Object

org.testng.internal.Graph<T>

public class Graph<T>
extends Object

Simple graph class to implement topological sort (used to sort methods based on what groups they depend on).

Author:

Cedric Beust, Aug 19, 2004

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	Graph.Node<T>

Constructor Summary

Constructors

Constructor and Description
Graph(Comparator<Graph.Node<T>> comparator)

Method Summary

Modifier and Type	Method and Description
void	addNode(T tm)
void	addPredecessor(T tm, T predecessor)
List<T>	findPredecessors(T o)
Set<T>	getIndependentNodes()
Set<T>	getNeighbors(T t)
Collection<T>	getNodeValues()
Set<T>	getPredecessors(T node)
List<T>	getStrictlySortedNodes()
boolean	isIndependent(T object)
void	topologicalSort()
String	toString()

Methods inherited from class java.lang.Object

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

Constructor Detail

Graph

public Graph(Comparator<Graph.Node<T>> comparator)

Method Detail

addNode

public void addNode(T tm)

getPredecessors

public Set<T> getPredecessors(T node)

isIndependent

public boolean isIndependent(T object)

addPredecessor

public void addPredecessor(T tm,
                           T predecessor)

getNeighbors

public Set<T> getNeighbors(T t)

getNodeValues

public Collection<T> getNodeValues()

getIndependentNodes

public Set<T> getIndependentNodes()

Returns:

All the nodes that don't have any order with each other.

getStrictlySortedNodes

public List<T> getStrictlySortedNodes()

Returns:

All the nodes that have an order with each other, sorted in one of the valid sorts.

topologicalSort

public void topologicalSort()

findPredecessors

public List<T> findPredecessors(T o)

Parameters:

o -

Returns:

A list of all the predecessors for o

toString

public String toString()

Overrides:

toString in class Object