return null;
}
//no cycles, perform a topological sorting of the graph
DirectedDepthFirstTopologicalIterator iterator =
new DirectedDepthFirstTopologicalIterator();
final ArrayList sorted = new ArrayList();
GraphWalker walker = new GraphWalker() {
public int visit(Graphable element, GraphTraversal traversal) {