DIV CSS 佈局教程網

您现在的位置: DIV+CSS佈局教程網 >> 網頁腳本 >  >> JavaScript入門知識 >> AJAX入門 >> AJAX詳解
C++ Boost Graph 深度優先與廣度優先搜尋範例
編輯:AJAX詳解     

Boost.Graph 提供了圖(graph)的資料結構與一系列圖演算法,其中深度優先搜尋(DFS)與廣度優先搜尋(BFS)是最基礎的兩種遍歷方式。以下範例以美國西岸城市構成的圖為例,示範如何搭配「訪客」(visitor)來觀察搜尋過程:

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

範例定義了三個訪客結構:city_arrival 在抵達某結點時觸發、neighbor_cities 在檢查邊時列出鄰居、finish_city 則在該結點的所有鄰居都被走訪後觸發。透過 make_dfs_visitor 與 make_bfs_visitor,並以 boost::make_list 把這三個訪客串接起來,就能分別觀察深度優先與廣度優先兩種搜尋的遍歷順序。這正是 Boost.Graph「演算法與行為分離」設計理念的絕佳示範——同一套圖結構,換個訪客就能得到截然不同的觀察視角。

XML學習教程| jQuery入門知識| AJAX入門| Dreamweaver教程| Fireworks入門知識| SEO技巧| SEO優化集錦|
Copyright © DIV+CSS佈局教程網 All Rights Reserved