Package | Description |
---|---|
org.testng.internal |
Modifier and Type | Field and Description |
---|---|
private java.util.Comparator<Graph.Node<T>> |
Graph.comparator |
private java.util.Map<T,Graph.Node<T>> |
Graph.m_independentNodes |
private java.util.Set<Graph.Node<T>> |
Graph.Node.m_neighbors |
private java.util.Map<T,Graph.Node<T>> |
Graph.m_nodes |
Modifier and Type | Method and Description |
---|---|
Graph.Node<T> |
Graph.Node.clone() |
private Graph.Node<T> |
Graph.findNode(T object) |
private Graph.Node<T> |
Graph.findNodeWithNoPredecessors(java.util.List<Graph.Node<T>> nodes) |
Modifier and Type | Method and Description |
---|---|
java.util.Set<Graph.Node<T>> |
Graph.Node.getNeighbors() |
private java.util.Collection<Graph.Node<T>> |
Graph.getNodes() |
Modifier and Type | Method and Description |
---|---|
void |
Graph.Node.addNeighbor(Graph.Node<T> neighbor) |
private void |
Graph.removeFromNodes(java.util.List<Graph.Node<T>> nodes,
Graph.Node<T> node)
Remove a node from a list of nodes and update the list of predecessors
for all the remaining nodes.
|
Modifier and Type | Method and Description |
---|---|
private Graph.Node<T> |
Graph.findNodeWithNoPredecessors(java.util.List<Graph.Node<T>> nodes) |
private void |
Graph.removeFromNodes(java.util.List<Graph.Node<T>> nodes,
Graph.Node<T> node)
Remove a node from a list of nodes and update the list of predecessors
for all the remaining nodes.
|
Constructor and Description |
---|
Graph(java.util.Comparator<Graph.Node<T>> comparator) |