[英]How to turn a directed graph to undirected graph?
我的方法“addEdge”將一個節點添加到所選節點的鄰接列表中,但我希望該方法也將所選節點添加到其鄰接列表中並將其轉換為無向圖。
public class Main {
public static void main(String[] args) {
Graph g = new Graph();
Node n1 = new Node("A");
Node n2 = new Node("B");
Node n3 = new Node("C");
Node n4 = new Node("D");
n1.addEdge(n2);
n2.addEdge(n3);
n3.addEdge(n4);
n4.addEdge(n1);
}
}
class Node{
String node;
boolean isVisited;
LinkedList<Node> edge;
Node(String node){
this.node = node;
edge = new LinkedList<>();
}
public void addEdge(Node node){
edge.add(node);
}
public LinkedList<Node> getEdge(){
return edge;
}
}
建議而不是
n1.addEdge(n2);
你做
g.addEdge( n1, n2 );
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.