boost_mirror/graph
1
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2025-05-10 07:23:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

Examples: Avoid signed/unsigned comparison warnings.

Browse Source
This commit is contained in:
Murray Cumming 2016-05-07 13:38:27 +02:00 committed by Murray Cumming
parent c3868dcdb7
commit 350e8d74c4
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
example/fibonacci_heap.cpp
View File

@ -34,7 +34,7 @@ int main()
uniform_int<> distrib(0, N - 1); uniform_int<> distrib(0, N - 1);
boost::variate_generator< random_ns::mt19937&, uniform_int<> > rand_gen( boost::variate_generator< random_ns::mt19937&, uniform_int<> > rand_gen(
gen, distrib); gen, distrib);
for (int t = 0; t < 10; ++t) for (std::size_t t = 0; t < 10; ++t)
{ {
std::vector< float > v, w(N); std::vector< float > v, w(N);

4
example/prim-telephone.cpp
View File

@ -53,12 +53,12 @@ int main()
#endif #endif
int total_weight = 0; int total_weight = 0;
for (int v = 0; v < num_vertices(g); ++v) for (std::size_t v = 0; v < num_vertices(g); ++v)
if (parent[v] != v) if (parent[v] != v)
total_weight += get(weight, edge(parent[v], v, g).first); total_weight += get(weight, edge(parent[v], v, g).first);
std::cout << "total weight: " << total_weight << std::endl; std::cout << "total weight: " << total_weight << std::endl;
for (int u = 0; u < num_vertices(g); ++u) for (std::size_t u = 0; u < num_vertices(g); ++u)
if (parent[u] != u) if (parent[u] != u)
edge_attr_map[edge(parent[u], u, g_dot).first]["color"] = "black"; edge_attr_map[edge(parent[u], u, g_dot).first]["color"] = "black";
std::ofstream out("figs/telephone-mst-prim.dot"); std::ofstream out("figs/telephone-mst-prim.dot");