如何使用DepthFirstSearchIterator类使用JGraphT在图上运行深度优先搜索(How to use the DepthFirstSearchIterator class to r

如何使用DepthFirstSearchIterator类使用JGraphT在图上运行深度优先搜索(How to use the DepthFirstSearchIterator class to run a depth first search on a graph using JGraphT)

我正在试验JGraphT并试图使用JGraphT API实现深度优先搜索。 我创建了一个带有节点和顶点的简单图，如下所示：

DirectedGraph <Integer, DefaultEdge> graph = new DefaultDirectedGraph <Integer, DefaultEdge>(DefaultEdge.class); graph.addVertex(7); graph.addVertex(4); graph.addVertex(9); graph.addVertex(3); graph.addVertex(2); graph.addVertex(5); graph.addEdge(7, 4); graph.addEdge(7, 9); graph.addEdge(9, 3); graph.addEdge(3, 2); graph.addEdge(3, 5);

我如何使用DepthFirstSearchIterator在此图上运行DFS？ 亲切的问候

I am experimenting with JGraphT and have hit a brick wall trying to implement a depth first search using the JGraphT API. I have created a simple graph with nodes and vertices's as follows:

DirectedGraph <Integer, DefaultEdge> graph = new DefaultDirectedGraph <Integer, DefaultEdge>(DefaultEdge.class); graph.addVertex(7); graph.addVertex(4); graph.addVertex(9); graph.addVertex(3); graph.addVertex(2); graph.addVertex(5); graph.addEdge(7, 4); graph.addEdge(7, 9); graph.addEdge(9, 3); graph.addEdge(3, 2); graph.addEdge(3, 5);

How would I use the DepthFirstSearchIterator to run DFS on this graph? Kind regards