Skip to content

use make_iterator_range in csr example #667

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Becheler merged 1 commit into from
Oct 27, 2026
+10 −6
Merged

use make_iterator_range in csr example #667

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 10 additions & 6 deletions example/csr-example.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,8 +8,8 @@
// Andrew Lumsdaine

#include <boost/graph/compressed_sparse_row_graph.hpp>
#include <boost/range/iterator_range_core.hpp>
#include <string>
#include <boost/graph/iteration_macros.hpp>
#include <iostream>
#include <fstream>
#include <boost/graph/graphviz.hpp>
Expand Down Expand Up @@ -43,15 +43,19 @@ int main()

// Set the URLs of each vertex
int index = 0;
BGL_FORALL_VERTICES(v, g, WebGraph)
g[v].url = urls[index++];
for(const auto v : boost::make_iterator_range(vertices(g)))
{
g[v].url = urls[index++];
}

// Output each of the links
std::cout << "The web graph:" << std::endl;
BGL_FORALL_EDGES(e, g, WebGraph)
std::cout << " " << g[source(e, g)].url << " -> " << g[target(e, g)].url
<< std::endl;

for(const auto& e : boost::make_iterator_range(edges(g)))
{
std::cout << " " << g[source(e, g)].url << " -> " << g[target(e, g)].url
<< std::endl;
}
// Output the graph in DOT format
dynamic_properties dp;
dp.property("label", get(&WebPage::url, g));
Expand Down
Loading