//create the traversal that uses the topological iterator
GraphTraversal traversal = new BasicGraphTraversal(
m_graph, this, m_iterator
);
traversal.init();
traversal.traverse();
//if all nodes visited then no cycle
if (m_graph.getNodes().size() == m_nvisited) return(false);
return(true);
}