Graph

java.lang.Object
- org.testng.internal.Graph<T>

```
public class Graph<T>
extends java.lang.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 Description

static class Graph.Node<T>

Constructor Summary

Constructors
Constructor Description

Graph(java.util.Comparator<Graph.Node<T>> comparator)

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`void`	`addNode(T tm)`
`void`	`addPredecessor(T tm, T predecessor)`
`java.util.List<T>`	`findPredecessors(T o)`
`java.util.Set<T>`	`getIndependentNodes()`
`java.util.Set<T>`	`getPredecessors(T node)`
`java.util.List<T>`	`getStrictlySortedNodes()`
`boolean`	`isIndependent(T object)`
`void`	`topologicalSort()`
`java.lang.String`	`toString()`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

Graph

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

Method Detail

addNode
```
public void addNode(T tm)
```

getPredecessors

public java.util.Set<T> getPredecessors(T node)

isIndependent

public boolean isIndependent(T object)

addPredecessor

public void addPredecessor(T tm,
                           T predecessor)

getIndependentNodes
```
public java.util.Set<T> getIndependentNodes()
```
Returns:

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

getStrictlySortedNodes
```
public java.util.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 java.util.List<T> findPredecessors(T o)
```
Parameters:

o - - The predecessor

Returns:

A list of all the predecessors for o

toString
```
public java.lang.String toString()
```
Overrides:

toString in class java.lang.Object