0
目前,我在兩個頂點之間只有一對一的關係。我只想處理兩個頂點之間的多個關係。我怎樣才能做到這一點?如何獲得bfs中兩個頂點之間的所有邊線java
我當前的代碼是:
public Collection<Vertex<V, E>> bfs() {
Queue<Graph.Vertex<V, E>> queue = new ArrayBlockingQueue<>(this.getVertices().size());
Collection<Vertex<V, E>> queryVertices = new LinkedList<>();
Vertex<V, E> source = this.vertices.get(0);
Set<Vertex<V, E>> visited = new HashSet<>();
visited.add(source);
queue.add(source);
queryVertices.add(source);
while (!queue.isEmpty()) {
Graph.Vertex<V, E> v = queue.remove();
Graph.Vertex<V, E> w;
while ((w = getAdjUnvisitedVertex(v, visited)) != null) {
visited.add(w);
queue.add(w);
queryVertices.add(w);
}
}
return queryVertices;
}
private Vertex<V, E> getAdjUnvisitedVertex(Vertex<V, E> v, Set<Vertex<V, E>> visited) {
for (Graph.Edge<V, E> edge : v.edges) {
if (!visited.contains(edge.getTo())) {
return edge.getTo();
}
}
return null;
}