public static <V, E extends DirectedEdge<V>> void traverse(
Graph<V, E> graph, Iterable<V> visitOrder, DFSVisitor<V, E> visitor) {
MutableMap<V, DFSStatus> status = DFSCore.createInitialStatus(graph);
AdjacencyListOfDirectedGraph<V, E> edges = AdjacencyListOfDirectedGraph.create(graph);
for (V v : visitOrder)
if (status.get(v) == DFSStatus.NOT_DISCOVERED) DFSCore.traverse(edges, status, v, visitor);
}
