// Find all the nodes that don't have any predecessors, add
// them to the result and mark them for removal
//
Node node = findNodeWithNoPredecessors(nodes2);
if (null == node) {
throw new TestNGException("Cyclic graph of methods");
}
else {
m_strictlySortedNodes.add((T) node.getObject());
removeFromNodes(nodes2, node);
}