boostorg/graph
1
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-07-21 13:23:42 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix: identation

Browse Source
This commit is contained in:
Arnaud Becheler
2026-06-20 17:19:15 +02:00
parent b70604ba98
commit 8ed6e4148b
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
doc/modules/ROOT/examples/algorithms/traversal/bfs_shortest_path.cpp
+4 -4
View File
@@ -5,7 +5,7 @@
#include <vector>
int main() {
using Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>;
using Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>;
using Vertex = Graph::vertex_descriptor;
// Undirected graph given as a list of (source, target) vertex-index pairs
@@ -23,15 +23,15 @@ int main() {
const Vertex target = 13;
// External storage for the results, one slot per vertex
std::vector<int> distance_storage(boost::num_vertices(g));
std::vector<int> distance_storage(boost::num_vertices(g));
std::vector<Vertex> predecessor_storage(boost::num_vertices(g));
// Three property maps:
// vertex -> its index (provided by the graph type)
auto vertex_index_map = boost::get(boost::vertex_index, g);
// vertex -> BFS distance from the source (wraps distance_storage)
auto distance = boost::make_iterator_property_map(distance_storage.begin(), vertex_index_map);
// vertex -> its parent in the BFS tree (wraps predecessor_storage)
auto distance = boost::make_iterator_property_map(distance_storage.begin(), vertex_index_map);
// vertex -> its parent in the BFS tree (wraps predecessor_storage)
auto predecessor = boost::make_iterator_property_map(predecessor_storage.begin(), vertex_index_map);
boost::breadth_first_search(g, source,