分享
 
 
 

C++ Boost graph 深度(广度)优先算法示例

王朝c/c++·作者佚名  2006-01-09
窄屏简体版  字體: |||超大  

//整理 by RobinKin from DevonIT.inc

#include <boost/config.hpp>

#include <iostream>

#include <vector>

#include <string>

#include <boost/graph/adjacency_list.hpp>

#include <boost/graph/depth_first_search.hpp>

#include <boost/graph/breadth_first_search.hpp>

#include <boost/property_map.hpp>

#include <boost/graph/graph_utility.hpp> // for boost::make_list

/*

Example of using a visitor with the depth first search

and breadth first search algorithm

Sacramento ---- Reno ---- Salt Lake City

|

San Francisco

|

San Jose ---- Fresno

|

Los Angeles ---- Los Vegas ---- Pheonix

|

San Diego

The visitor has three main functions:

discover_vertex(u,g) is invoked when the algorithm first arrives at the

vertex u. This will happen in the depth first or breadth first

order depending on which algorithm you use.

examine_edge(e,g) is invoked when the algorithm first checks an edge to see

whether it has already been there. Whether using BFS or DFS, all

the edges of vertex u are examined immediately after the call to

visit(u).

finish_vertex(u,g) is called when after all the vertices reachable from vertex

u have already been visited.

*/

using namespace std;

using namespace boost;

//到达结点时 operator()

struct city_arrival : public base_visitor<city_arrival>

{

city_arrival(string* n) : names(n) { }

typedef on_discover_vertex event_filter;

template <class Vertex, class Graph>

inline void operator()(Vertex u, Graph&) {

cout << endl << "arriving at " << names[u] << endl

<< " neighboring cities are: ";

}

string* names;

};

//显示邻接结点时 。调用 operator()

struct neighbor_cities : public base_visitor<neighbor_cities>

{

neighbor_cities(string* n) : names(n) { }

typedef on_examine_edge event_filter;

template <class Edge, class Graph>

inline void operator()(Edge e, Graph& g) {

cout << names[ target(e, g) ] << ", ";

}

string* names;

};

//某结点的所有邻接结点都已经被访问过时 调用 operator()

struct finish_city : public base_visitor<finish_city>

{

finish_city(string* n) : names(n) { }

typedef on_finish_vertex event_filter;

template <class Vertex, class Graph>

inline void operator()(Vertex u, Graph&) {

cout << endl << "finished with " << names[u] << endl;

}

string* names;

};

int main(int, char*[])

{

enum { SanJose, SanFran, LA, SanDiego, Fresno, LosVegas, Reno,

Sacramento, SaltLake, Pheonix, N };

string names[] = { "San Jose", "San Francisco", "San Jose",

"San Francisco", "Los Angeles", "San Diego",

"Fresno", "Los Vegas", "Reno", "Sacramento",

"Salt Lake City", "Pheonix" };

typedef std::pair<int,int> E;

E edge_array[] = { E(Sacramento, Reno), E(Sacramento, SanFran),

E(Reno, SaltLake),

E(SanFran, SanJose),

E(SanJose, Fresno), E(SanJose, LA),

E(LA, LosVegas), E(LA, SanDiego),

E(LosVegas, Pheonix) };

/* Create the graph type we want. */

typedef adjacency_list<vecS, vecS, undirectedS> Graph;

Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), N);

cout << "*** Depth First ***" << endl;

//第 1 2 3 个参数分别是 arrival neighbor finish

depth_first_search

(G,

visitor(make_dfs_visitor(boost::make_list(city_arrival(names),

neighbor_cities(names),

finish_city(names)))));

cout << endl;

/* Get the source vertex */

boost::graph_traits<Graph>::vertex_descriptor

s = vertex(SanJose,G);

cout << "*** Breadth First ***" << endl;

breadth_first_search

(G, s, visitor(make_bfs_visitor(boost::make_list(city_arrival(names),

neighbor_cities(names),

finish_city(names)))));

return 0;

}

//输出:

*** Depth First ***

arriving at San Jose

neighboring cities are: San Francisco,

arriving at San Francisco

neighboring cities are: Los Vegas,

arriving at Los Vegas

neighboring cities are: Fresno,

arriving at Fresno

neighboring cities are: Los Vegas, Reno,

arriving at Reno

neighboring cities are: Fresno,

finished with Reno

finished with Fresno

San Francisco,

finished with Los Vegas

San Jose,

finished with San Francisco

Los Angeles,

arriving at Los Angeles

neighboring cities are: San Jose,

finished with Los Angeles

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
2023年上半年GDP全球前十五强
 百态   2023-10-24
美众议院议长启动对拜登的弹劾调查
 百态   2023-09-13
上海、济南、武汉等多地出现不明坠落物
 探索   2023-09-06
印度或要将国名改为“巴拉特”
 百态   2023-09-06
男子为女友送行,买票不登机被捕
 百态   2023-08-20
手机地震预警功能怎么开?
 干货   2023-08-06
女子4年卖2套房花700多万做美容:不但没变美脸,面部还出现变形
 百态   2023-08-04
住户一楼被水淹 还冲来8头猪
 百态   2023-07-31
女子体内爬出大量瓜子状活虫
 百态   2023-07-25
地球连续35年收到神秘规律性信号,网友:不要回答!
 探索   2023-07-21
全球镓价格本周大涨27%
 探索   2023-07-09
钱都流向了那些不缺钱的人,苦都留给了能吃苦的人
 探索   2023-07-02
倩女手游刀客魅者强控制(强混乱强眩晕强睡眠)和对应控制抗性的关系
 百态   2020-08-20
美国5月9日最新疫情:美国确诊人数突破131万
 百态   2020-05-09
荷兰政府宣布将集体辞职
 干货   2020-04-30
倩女幽魂手游师徒任务情义春秋猜成语答案逍遥观:鹏程万里
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案神机营:射石饮羽
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案昆仑山:拔刀相助
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案天工阁:鬼斧神工
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案丝路古道:单枪匹马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:与虎谋皮
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:李代桃僵
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:指鹿为马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:小鸟依人
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:千金买邻
 干货   2019-11-12
 
推荐阅读
 
 
 
>>返回首頁<<
 
靜靜地坐在廢墟上,四周的荒凉一望無際,忽然覺得,淒涼也很美
© 2005- 王朝網路 版權所有