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

原创 2005年02月25日 16:50:00

//整理 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

相关文章推荐

Boost Graph Library 快速入门

Boost Graph Library 快速入门   图领域的数据结构和算法在某些方面比容器更为复杂,图算法在图中移动有着众多的路线,而ST...

使用C++ Boost Graph Library 进行社交网络分析入门篇

前言:      社交网络分析是一个常常会遇到的业务问题,故而笔者也一致在不断尝试不同的社交网络分析工具。之前使用过python networkx, igraph C library, 今日再介...

C++实现图算法(一)

图算法(一) 对图的顶点和边进行了封装。

图的表示方法 c++ 实现

图的表示最长用的两种方法是: 1)、邻接矩阵表示法 2)、邻接表表示 下面是两种构造图的方法 1)邻接矩阵: 2)邻接链表 #include using namespace std; //枚举...

Delphi7高级应用开发随书源码

  • 2003年04月30日 00:00
  • 676KB
  • 下载

boost graph lib 小试牛刀

最近要做社会网络的社区发现,发现用BGL能减少不少代码量。经过一番调研发现BGL封装的很牛叉,Dijkstra等算法统统具备,奈何自己对泛型编程不太熟, 遇到问题还是很纠结。Primer泛型编程、算...

boost graph --- 有向图中两点间所有路径(可处理有环情况)

求有向图中两点间所有路径
  • qazxlf
  • qazxlf
  • 2015年05月29日 09:57
  • 1809

Boost Graph Library 学习笔记

最近研究了一下boost graph library(简称BGL)。由于文档的过于简略和使用者数量较少,一时半会弄明白还不是那么简单的一件事情。网上也有不少入门文章,这些我就不再说了,主要说一下我遇到...

Boost Graph Library (BGL)学习:使用Bundled Properties

// 所有原创文章转载请注明作者及链接// blackboycpp(AT)gmail.com// QQ群: 135202158  /* * 文件: Unit1.cpp * 日期: 2008-1...

图论学习(一)使用Boost Graph Library表示图

本文通过使用Boost Graph Library实现图的新建和遍历,来学习图论算法。
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:C++ Boost graph 深度(广度)优先算法示例
举报原因:
原因补充:

(最多只允许输入30个字)