JGraphT:无论边缘方向如何，都能找到最短路径

Question

我使用 JGraphT 构建了下图 A->B<-C，如下所示：

    DirectedPseudograph<Node, Edge> graph = new DirectedPseudograph<>(Edge.class);
    DijkstraShortestPath<Node, Edge> shortestPath = new DijkstraShortestPath<Node, Edge>(graph);
    Node bn1 = new Node("1", "A", null);
    Node bn2 = new Node("2", "B", null);
    Node bn3 = new Node("3", "C", null);
    graph.addVertex(bn1);
    graph.addVertex(bn2);
    graph.addVertex(bn3);
    Edge edge1 = new Edge("PART_OF");
    Edge edge2 = new Edge("IS_A");
    graph.addEdge(bn1, bn2, edge1);
    graph.addEdge(bn3, bn2, edge2);

但每当我尝试打电话时：

shortestPath.getPath(node1, node3);

我得到一个空数组，这意味着没有连接。我知道这可能与边缘的方向有关，因为 A->B->C 工作正常。有没有办法找到路径，而不管 A 和 C 之间的边缘方向如何？

Answer 1

你可以使用 AsUndirectedGraph 类来实现这一点。

Graph<Node, Edge> graph = new DirectedPseudograph<>(Edge.class);
Node bn1 = new Node("1", "A", null);
Node bn2 = new Node("2", "B", null);
Node bn3 = new Node("3", "C", null);
graph.addVertex(bn1);
graph.addVertex(bn2);
graph.addVertex(bn3);
Edge edge1 = new Edge("PART_OF");
Edge edge2 = new Edge("IS_A");
graph.addEdge(bn1, bn2, edge1);
graph.addEdge(bn3, bn2, edge2);
Graph<Node, Edge> undirGraph=new AsUndirectedGraph<>(graph);
ShortestPathAlgorithm<Node, Edge> shortestPath = new DijkstraShortestPath<Node, Edge>(undirGraph);

注意：您可能希望使用SimpleDirectedGraph而不是DirectedPseudograph，除非您确实需要多个边/自循环。