C++ Boost graph 深度（广度）优先算法示例

关注

VIP免费原创最新推荐文章于 2026-09-21 16:55:40 发布 5.3k 阅读 AI 写同款· GEO 优化 ›

Boost Graph Library：C++ 图论算法的高效封装工具，采用 BGL 的多路径分离算法以 Boost Graph Library 库为基础，完成最短路径算法（dijkstra）的更多改进算法，讨论寻找第 2 短路径的算法流程及代码，两条最短路径支持边分离策略及节点分离策略。阅读详情

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