C++ Boost graph库 广度优先遍历算法示例
来源:互联网 发布:电力系统潮流计算算法 编辑:程序博客网 时间:2024/06/05 18:30
//(整理by RobinKin from DevonIT)
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/pending/indirect_cmp.hpp>
#include <boost/pending/integer_range.hpp>
#include <iostream>
using namespace boost;
template < typename TimeMap > class bfs_time_visitor:public default_bfs_visitor {
typedef typename property_traits < TimeMap >::value_type T;
public:
bfs_time_visitor(TimeMap tmap, T & t):m_timemap(tmap), m_time(t) { }
template < typename Vertex, typename Graph >
void discover_vertex(Vertex u, const Graph & g) const
{
put(m_timemap, u, m_time++);//每次访问 m_time加1
}
TimeMap m_timemap;
T & m_time;
};
int
main()
{
using namespace boost;
// Select the graph type we wish to use
typedef adjacency_list < vecS, vecS, undirectedS > graph_t;
// Set up the vertex IDs and names
enum { r, s, t, u, v, w, x, y, N };
const char *name = "rstuvwxy";
// Specify the edges in the graph
typedef std::pair < int, int >E; //边对
E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t),
E(w, x), E(x, t), E(t, u), E(x, y), E(u, y)
};
// Create the graph object
const int n_edges = sizeof(edge_array) / sizeof(E);
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
// VC++ has trouble with the edge iterator constructor
graph_t g(N);
for (std::size_t j = 0; j < n_edges; ++j)
add_edge(edge_array[j].first, edge_array[j].second, g);
#else
typedef graph_traits<graph_t>::vertices_size_type v_size_t;
graph_t g(edge_array, edge_array + n_edges, v_size_t(N));//构造图
#endif
// Typedefs
typedef graph_traits < graph_t >::vertex_descriptor Vertex;
typedef graph_traits < graph_t >::vertices_size_type Size;
typedef Size* Iiter;
// a vector to hold the discover time property for each vertex
std::vector < Size > dtime(num_vertices(g));//访问时间
Size time = 0;
bfs_time_visitor < Size * >vis(&dtime[0], time);
breadth_first_search(g, vertex(s, g), visitor(vis));
// Use std::sort to order the vertices by their discover time
std::vector<graph_traits<graph_t>::vertices_size_type > discover_order(N);
integer_range < int >range(0, N);
std::copy(range.begin(), range.end(), discover_order.begin());
std::sort(discover_order.begin(), discover_order.end(),
indirect_cmp < Iiter, std::less < Size > >(&dtime[0]));
std::cout << "order of discovery: ";
for (int i = 0; i < N; ++i)
std::cout << name[discover_order[i]] << " ";
std::cout << std::endl;
return EXIT_SUCCESS;
}
// 输出 :
order of discovery: s r w v t x u y
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/pending/indirect_cmp.hpp>
#include <boost/pending/integer_range.hpp>
#include <iostream>
using namespace boost;
template < typename TimeMap > class bfs_time_visitor:public default_bfs_visitor {
typedef typename property_traits < TimeMap >::value_type T;
public:
bfs_time_visitor(TimeMap tmap, T & t):m_timemap(tmap), m_time(t) { }
template < typename Vertex, typename Graph >
void discover_vertex(Vertex u, const Graph & g) const
{
put(m_timemap, u, m_time++);//每次访问 m_time加1
}
TimeMap m_timemap;
T & m_time;
};
int
main()
{
using namespace boost;
// Select the graph type we wish to use
typedef adjacency_list < vecS, vecS, undirectedS > graph_t;
// Set up the vertex IDs and names
enum { r, s, t, u, v, w, x, y, N };
const char *name = "rstuvwxy";
// Specify the edges in the graph
typedef std::pair < int, int >E; //边对
E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t),
E(w, x), E(x, t), E(t, u), E(x, y), E(u, y)
};
// Create the graph object
const int n_edges = sizeof(edge_array) / sizeof(E);
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
// VC++ has trouble with the edge iterator constructor
graph_t g(N);
for (std::size_t j = 0; j < n_edges; ++j)
add_edge(edge_array[j].first, edge_array[j].second, g);
#else
typedef graph_traits<graph_t>::vertices_size_type v_size_t;
graph_t g(edge_array, edge_array + n_edges, v_size_t(N));//构造图
#endif
// Typedefs
typedef graph_traits < graph_t >::vertex_descriptor Vertex;
typedef graph_traits < graph_t >::vertices_size_type Size;
typedef Size* Iiter;
// a vector to hold the discover time property for each vertex
std::vector < Size > dtime(num_vertices(g));//访问时间
Size time = 0;
bfs_time_visitor < Size * >vis(&dtime[0], time);
breadth_first_search(g, vertex(s, g), visitor(vis));
// Use std::sort to order the vertices by their discover time
std::vector<graph_traits<graph_t>::vertices_size_type > discover_order(N);
integer_range < int >range(0, N);
std::copy(range.begin(), range.end(), discover_order.begin());
std::sort(discover_order.begin(), discover_order.end(),
indirect_cmp < Iiter, std::less < Size > >(&dtime[0]));
std::cout << "order of discovery: ";
for (int i = 0; i < N; ++i)
std::cout << name[discover_order[i]] << " ";
std::cout << std::endl;
return EXIT_SUCCESS;
}
// 输出 :
order of discovery: s r w v t x u y
- C++ Boost graph库 广度优先遍历算法示例
- C++ Boost graph 深度(广度)优先算法示例
- 广度优先遍历-示例
- 深度、广度优先遍历算法C实现
- 深度、广度优先遍历算法C实现
- BFS广度优先遍历算法
- 数据结构 - 二叉树的广度优先遍历算法(C++)
- 算法学习 - 图的广度优先遍历(BFS) (C++)
- Graph(3)--图的遍历(深度优先&广度优先)
- 深度优先和广度优先遍历算法
- 深度优先遍历与广度优先遍历算法的C语言实现
- 图的深度优先遍历和广度优先遍历算法
- 树的广度优先遍历与深度优先遍历算法
- 广度优先遍历BFS的图算法
- 图的广度优先遍历算法
- 营救公主-广度优先遍历算法
- 图的广度优先遍历算法
- 二叉树深度优先遍历和广度优先遍历【C++】
- 在C#中利用SharpZipLib进行文件的压缩和解压缩
- 在Java中应用设计模式 - Factory Method
- 可变参数函数的原理
- vsftp 跨 NAT 访问的设置
- 修炼一名程序员的职业水准
- C++ Boost graph库 广度优先遍历算法示例
- test
- 厌倦了闪动的页面?来试试 javascript+WebService 吧!
- 打印出所有该目录下的文件和文件夹
- 如何考核测试人员?
- How To Submit Form Data by Using XMLHTTP or ServerXMLHTTP Object
- JAVA文件加密器(收藏)
- 使用xmlhttp为网站增加域名查询功能
- 用ant来管理项目