boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-26 18:42:12 +00:00
Code Issues Projects Releases Wiki Activity

Fixing some errors and warnings on the planar graph tests coming from Sun compilers.

Browse Source 
[SVN r39763]
This commit is contained in:
Aaron Windsor
2007-10-07 16:52:39 +00:00
parent 98d0755817
commit 40ffa294a2
2 changed files with 6 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
include/boost/graph/make_biconnected_planar.hpp
View File

@@ -44,8 +44,9 @@ namespace boost
typedef iterator_property_map
<std::vector<std::size_t>::iterator, EdgeIndexMap> component_map_t;
edge_size_t n_edges(num_edges(g));
std::vector<vertex_t> articulation_points;
std::vector<edge_size_t> component_vector(num_edges(g));
std::vector<edge_size_t> component_vector(n_edges);
component_map_t component_map(component_vector.begin(), em);
biconnected_components(g, component_map,
@@ -58,7 +59,7 @@ namespace boost
vertex_t v(*ap);
embedding_iterator_t pi = embedding[v].begin();
embedding_iterator_t pi_end = embedding[v].end();
edge_size_t previous_component;
edge_size_t previous_component(n_edges + 1);
vertex_t previous_vertex = graph_traits<Graph>::null_vertex();
for(; pi != pi_end; ++pi)

12
include/boost/graph/planar_detail/boyer_myrvold_impl.hpp
View File

@@ -465,9 +465,7 @@ namespace boost
// to v. This will set the stage for the walkdown to efficiently
// traverse the graph of bicomps down from v.
typedef face_iterator
<Graph, vertex_to_face_handle_map_t, vertex_t, both_sides>
walkup_iterator_t;
typedef face_vertex_iterator<both_sides>::type walkup_iterator_t;
out_edge_iterator_t oi, oi_end;
for(tie(oi,oi_end) = out_edges(v,g); oi != oi_end; ++oi)
@@ -1083,9 +1081,7 @@ namespace boost
return current_endpoint;
}
typedef face_iterator
<Graph, vertex_to_face_handle_map_t, edge_t, single_side>
walkup_itr_t;
typedef face_edge_iterator<>::type walkup_itr_t;
walkup_itr_t
walkup_itr(current_endpoint, face_handles, first_side());
@@ -1323,9 +1319,7 @@ namespace boost
bicomp_root = current_vertex;
}
typedef face_iterator
<Graph, vertex_to_face_handle_map_t, edge_t, single_side> walkup_itr_t;
typedef face_edge_iterator<>::type walkup_itr_t;
std::vector<bool> outer_face_edge_vector(num_edges(g), false);
edge_to_bool_map_t outer_face_edge(outer_face_edge_vector.begin(), em);