C++ 在图形上执行BFS后,值顺序是否不符合预期?
我正在尝试创建一个基于邻接列表的图表。这是图表的结构C++ 在图形上执行BFS后,值顺序是否不符合预期?,c++,data-structures,graph,breadth-first-search,adjacency-list,C++,Data Structures,Graph,Breadth First Search,Adjacency List,我正在尝试创建一个基于邻接列表的图表。这是图表的结构 class Graph{ private: struct Vertex { int data; Vertex *next; set<int> anti; }; struct Neighbors { Vertex *head; }; public: int Limit; list<int> pr
class Graph{
private:
struct Vertex
{
int data;
Vertex *next;
set<int> anti;
};
struct Neighbors
{
Vertex *head;
};
public:
int Limit;
list<int> print_list;
Neighbors *adjacent;
Graph(int Limit);
Vertex* Add_Vertex(int data);
void Connect(int before, int data);
void Display();
list<int> BFS(int v);
list<int> DFS(int source);
};
BFS实施(不包括主调用):
Graph::Vertex* Graph::Add_Vertex(int data)
{
//Initialize vertex
Vertex* temp = new Vertex;
temp->data = data;
temp->next = NULL;
return temp;
}
void Graph::Connect(int first, int second)
{
Vertex *temp;
//Create a vertex and get pointer for second
if (first != second) {
//Create a vertex and get a pointer for first
temp = Add_Vertex(first);
//Connect created node to second vertex
temp->next = adjacent[second].head;
adjacent[second].head = temp;
}
temp = Add_Vertex(second);
//Connect created node to first vertex
temp->next = adjacent[first].head;
adjacent[first].head = temp;
}
list<int> Graph::BFS(int from) {
print_list.clear();
bool *visited = new bool[Limit];
for (int i = 0; i < Limit; i++)
visited[i] = false;
list<int> queue;
visited[from] = true;
queue.push_back(from);
while (!queue.empty())
{
from = queue.front();
print_list.push_back(from);
queue.pop_front();
Vertex *Displaying = adjacent[from].head;
while (Displaying)
{
int adjacent_node = Displaying->data;
if (!visited[adjacent_node])
{
visited[adjacent_node] = true;
queue.push_back(adjacent_node);
}
Displaying = Displaying->next;
}
}
return print_list;
}
列表图::BFS(int-from){
打印列表。清除();
bool*visted=新bool[Limit];
对于(int i=0;i数据;
如果(!已访问[相邻_节点])
{
已访问[相邻_节点]=真;
队列。向后推_(相邻_节点);
}
显示=显示->下一步;
}
}
返回打印列表;
}
另一项测试是:
12,23,15,14,47,78,89,26,57
预期:
1 2 4 5 3 6 7 8 9
实际:
1 4 5 2 7 6 3 8 9
当起始顶点为1时。在
BFS
中,使用队列跟踪需要访问的节点。从前面拉下一个节点,并将要访问的新节点添加到末尾
相反,您要使用的是堆栈—从末尾添加和删除节点。这将围绕访问的顺序节点进行更改,并更改生成的输出
或者,您可以保持BFS
中的代码不变,并更改Connect
以将新节点添加到邻居列表的末尾,而不是开始