二叉树的广度优先搜索及深度优先搜索.docxVIP

#includeiostream#includecstdlib#includeset#includevector#includelist#includestack#includequeue#includeiteratorusing namespace std;//广度优先搜索/*voidbfs(vectorlistintadj_lists, intstart_node){queueintnot_yet_explored; //还没有访问过的节点setintdiscovered; //已经访问过的节点not_yet_explored.push(start_node);discovered.insert(start_node);while (!not_yet_explored.empty()){//获得一个新的点并以此作为基点进行探索intnode_to_explore = not_yet_explored.front();not_yet_explored.pop();//从本节的第一个邻接顶点开始查找listint::iterator edges = adj_lists[node_to_explore].begin();for (; edges != adj_lists[node_to_explore].end(); edges++){if (discovered.count(*edges) == 0){discovered.insert(*edges);not_yet_explored.push(*edges);cout Foude edges from node_to_explore endl;}}}}*/voidbfs(vectorlistintadj_lists, intstart_node){queueintnot_yet_explored; //还没有访问过的节点setintdiscovered; //已经访问过的节点not_yet_explored.push(start_node);discovered.insert(start_node);while (!not_yet_explored.empty()){intnode_to_explore = not_yet_explored.front();not_yet_explored.pop();listint::iterator iter = adj_lists[node_to_explore].begin();for (; iter != adj_lists[node_to_explore].end(); iter++){if (0 == discovered.count(*iter)){not_yet_explored.push(*iter);discovered.insert(*iter);cout 找到节点 *iter endl;}}}}voiddfs(vectorlistintadj_lists, intstart_node){stackintnot_yet_explored; //还没有访问过的节点setintdiscovered; //已经访问过的节点not_yet_explored.push(start_node);discovered.insert(start_node);cout start_node endl;while (!not_yet_explored.empty()){intnode_to_explored = not_yet_explored.top();listint::iterator iter = adj_lists[node_to_explored].begin();for (; iter != adj_lists[node_to_explored].end(); iter++){if (discovered.count(*iter) == 0){not_yet_explored.push(*iter);discovered.insert(*iter);cout 已经找到 *iter endl;break;}}if (iter == adj_lists[node_to_explored].end()){not_yet_explored.pop();}}}int main(){//初始化图的信息vectorlistintg(7, listint());g[0].push_back(2);g[0].push_back(1);g[1].push_back(0);g[1].push_back(2);g[2].push_back(4);g[2].push_back