|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r57544 - in trunk: boost/graph boost/graph/detail boost/graph/planar_detail boost/graph/property_maps libs/graph/test
From: jewillco_at_[hidden]
Date: 2009-11-10 11:54:06
Author: jewillco
Date: 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
New Revision: 57544
URL: http://svn.boost.org/trac/boost/changeset/57544
Log:
Fixed warnings
Text files modified:
trunk/boost/graph/adjacency_list_io.hpp | 2 +-
trunk/boost/graph/adjacency_matrix.hpp | 8 ++++----
trunk/boost/graph/astar_search.hpp | 4 ++--
trunk/boost/graph/compressed_sparse_row_graph.hpp | 16 ++++++++++++----
trunk/boost/graph/core_numbers.hpp | 2 +-
trunk/boost/graph/dag_shortest_paths.hpp | 2 +-
trunk/boost/graph/detail/compressed_sparse_row_struct.hpp | 4 ++--
trunk/boost/graph/detail/histogram_sort.hpp | 4 ++--
trunk/boost/graph/dominator_tree.hpp | 2 +-
trunk/boost/graph/floyd_warshall_shortest.hpp | 2 +-
trunk/boost/graph/geodesic_distance.hpp | 2 +-
trunk/boost/graph/grid_graph.hpp | 2 +-
trunk/boost/graph/howard_cycle_ratio.hpp | 4 ++--
trunk/boost/graph/is_straight_line_drawing.hpp | 2 +-
trunk/boost/graph/isomorphism.hpp | 2 +-
trunk/boost/graph/labeled_graph.hpp | 2 +-
trunk/boost/graph/max_cardinality_matching.hpp | 12 ++++++------
trunk/boost/graph/mcgregor_common_subgraphs.hpp | 4 ++--
trunk/boost/graph/metric_tsp_approx.hpp | 8 ++++----
trunk/boost/graph/named_function_params.hpp | 6 +++---
trunk/boost/graph/planar_detail/boyer_myrvold_impl.hpp | 6 +++---
trunk/boost/graph/planar_face_traversal.hpp | 4 ++--
trunk/boost/graph/property_maps/constant_property_map.hpp | 2 +-
trunk/boost/graph/r_c_shortest_paths.hpp | 14 +++++++-------
trunk/boost/graph/two_bit_color_map.hpp | 6 ++++--
trunk/libs/graph/test/astar_search_test.cpp | 4 ++--
trunk/libs/graph/test/basic_planarity_test.cpp | 2 +-
trunk/libs/graph/test/bron_kerbosch_all_cliques.cpp | 2 +-
trunk/libs/graph/test/closeness_centrality.cpp | 4 ++--
trunk/libs/graph/test/clustering_coefficient.cpp | 4 ++--
trunk/libs/graph/test/core_numbers_test.cpp | 8 ++++----
trunk/libs/graph/test/csr_graph_test.cpp | 2 +-
trunk/libs/graph/test/degree_centrality.cpp | 4 ++--
trunk/libs/graph/test/dfs.cpp | 8 ++++----
trunk/libs/graph/test/dominator_tree_test.cpp | 2 +-
trunk/libs/graph/test/eccentricity.cpp | 4 ++--
trunk/libs/graph/test/grid_graph_cc.cpp | 4 ++--
trunk/libs/graph/test/grid_graph_test.cpp | 6 +++---
trunk/libs/graph/test/is_straight_line_draw_test.cpp | 2 +-
trunk/libs/graph/test/layout_test.cpp | 4 ++--
trunk/libs/graph/test/make_bicon_planar_test.cpp | 2 +-
trunk/libs/graph/test/make_maximal_planar_test.cpp | 2 +-
trunk/libs/graph/test/matching_test.cpp | 4 ++--
trunk/libs/graph/test/mcgregor_subgraphs_test.cpp | 4 ++--
trunk/libs/graph/test/mean_geodesic.cpp | 4 ++--
trunk/libs/graph/test/metric_tsp_approx.cpp | 2 +-
trunk/libs/graph/test/named_vertices_test.cpp | 2 +-
trunk/libs/graph/test/r_c_shortest_paths_test.cpp | 2 +-
trunk/libs/graph/test/serialize.cpp | 4 ++--
trunk/libs/graph/test/subgraph.cpp | 2 +-
trunk/libs/graph/test/subgraph_bundled.cpp | 2 +-
trunk/libs/graph/test/test_construction.hpp | 2 +-
trunk/libs/graph/test/test_destruction.hpp | 6 +++---
trunk/libs/graph/test/test_direction.hpp | 6 +++---
trunk/libs/graph/test/tiernan_all_cycles.cpp | 2 +-
55 files changed, 119 insertions(+), 109 deletions(-)
Modified: trunk/boost/graph/adjacency_list_io.hpp
==============================================================================
--- trunk/boost/graph/adjacency_list_io.hpp (original)
+++ trunk/boost/graph/adjacency_list_io.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -94,7 +94,7 @@
}
inline void getSubset
-( no_property& p, const no_property& s )
+( no_property&, const no_property& )
{
}
Modified: trunk/boost/graph/adjacency_matrix.hpp
==============================================================================
--- trunk/boost/graph/adjacency_matrix.hpp (original)
+++ trunk/boost/graph/adjacency_matrix.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -991,7 +991,7 @@
template <typename D, typename VP, typename EP, typename GP, typename A>
inline typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor
- add_vertex(const VP& vp, adjacency_matrix<D,VP,EP,GP,A>& g) {
+ add_vertex(const VP& /*vp*/, adjacency_matrix<D,VP,EP,GP,A>& g) {
// UNDER CONSTRUCTION
assert(false);
return *vertices(g).first;
@@ -999,8 +999,8 @@
template <typename D, typename VP, typename EP, typename GP, typename A>
inline void
- remove_vertex(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor u,
- adjacency_matrix<D,VP,EP,GP,A>& g)
+ remove_vertex(typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor /*u*/,
+ adjacency_matrix<D,VP,EP,GP,A>& /*g*/)
{
// UNDER CONSTRUCTION
assert(false);
@@ -1298,7 +1298,7 @@
template <typename D, typename VP, typename EP, typename GP, typename A>
typename adjacency_matrix<D,VP,EP,GP,A>::vertex_descriptor
vertex(typename adjacency_matrix<D,VP,EP,GP,A>::vertices_size_type n,
- const adjacency_matrix<D,VP,EP,GP,A>& g)
+ const adjacency_matrix<D,VP,EP,GP,A>&)
{
return n;
}
Modified: trunk/boost/graph/astar_search.hpp
==============================================================================
--- trunk/boost/graph/astar_search.hpp (original)
+++ trunk/boost/graph/astar_search.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -238,9 +238,9 @@
AStarHeuristic h, AStarVisitor vis,
PredecessorMap predecessor, CostMap cost,
DistanceMap distance, WeightMap weight,
- ColorMap color, VertexIndexMap index_map,
+ ColorMap color, VertexIndexMap /*index_map*/,
CompareFunction compare, CombineFunction combine,
- CostInf inf, CostZero zero)
+ CostInf /*inf*/, CostZero zero)
{
typedef typename graph_traits<VertexListGraph>::vertex_descriptor
Vertex;
Modified: trunk/boost/graph/compressed_sparse_row_graph.hpp
==============================================================================
--- trunk/boost/graph/compressed_sparse_row_graph.hpp (original)
+++ trunk/boost/graph/compressed_sparse_row_graph.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -1340,20 +1340,28 @@
return g.m_forward.m_column[e.idx];
}
+#ifdef BOOST_GRAPH_USE_NEW_CSR_INTERFACE
namespace detail {
template<BOOST_CSR_GRAPH_TEMPLATE_PARMS>
inline EdgeIndex get_actual_row_start
- (const BOOST_CSR_GRAPH_TYPE& g,
- EdgeIndex rowstart_i_minus_1, EdgeIndex rowstart_i)
+ (const BOOST_CSR_GRAPH_TYPE& /*g*/,
+ EdgeIndex /*rowstart_i_minus_1*/, EdgeIndex rowstart_i)
{
-#ifdef BOOST_GRAPH_USE_NEW_CSR_INTERFACE
return rowstart_i;
+ }
+}
#else
+namespace detail {
+ template<BOOST_CSR_GRAPH_TEMPLATE_PARMS>
+ inline EdgeIndex get_actual_row_start
+ (const BOOST_CSR_GRAPH_TYPE& /*g*/,
+ EdgeIndex rowstart_i_minus_1, EdgeIndex rowstart_i)
+ {
// Special case to allow incremental construction
return (std::max)(rowstart_i_minus_1, rowstart_i);
-#endif
}
}
+#endif // BOOST_GRAPH_USE_NEW_CSR_INTERFACE
template<BOOST_CSR_GRAPH_TEMPLATE_PARMS>
inline std::pair<typename BOOST_CSR_GRAPH_TYPE::out_edge_iterator,
Modified: trunk/boost/graph/core_numbers.hpp
==============================================================================
--- trunk/boost/graph/core_numbers.hpp (original)
+++ trunk/boost/graph/core_numbers.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -86,7 +86,7 @@
template <class Visitors>
core_numbers_visitor<Visitors> make_core_numbers_visitor(Visitors vis)
- { return core_numbers_visitor<Visitors>(vis); };
+ { return core_numbers_visitor<Visitors>(vis); }
typedef core_numbers_visitor<> default_core_numbers_visitor;
Modified: trunk/boost/graph/dag_shortest_paths.hpp
==============================================================================
--- trunk/boost/graph/dag_shortest_paths.hpp (original)
+++ trunk/boost/graph/dag_shortest_paths.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -83,7 +83,7 @@
dag_sp_dispatch2
(const VertexListGraph& g,
typename graph_traits<VertexListGraph>::vertex_descriptor s,
- DistanceMap distance, WeightMap weight, ColorMap color, IndexMap id,
+ DistanceMap distance, WeightMap weight, ColorMap color, IndexMap /*id*/,
DijkstraVisitor vis, const Params& params)
{
typedef typename property_traits<DistanceMap>::value_type D;
Modified: trunk/boost/graph/detail/compressed_sparse_row_struct.hpp
==============================================================================
--- trunk/boost/graph/detail/compressed_sparse_row_struct.hpp (original)
+++ trunk/boost/graph/detail/compressed_sparse_row_struct.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -251,7 +251,7 @@
(sources.begin(), sources.end(), m_rowstart.begin(), numverts,
keep_all(), boost::make_property_map_function(global_to_local));
boost::graph::detail::histogram_sort_inplace
- (sources.begin(), sources.end(), m_rowstart.begin(), numverts,
+ (sources.begin(), m_rowstart.begin(), numverts,
targets.begin(), boost::make_property_map_function(global_to_local));
// Now targets is the correct vector (properly sorted by source) for
// m_column
@@ -277,7 +277,7 @@
(sources.begin(), sources.end(), m_rowstart.begin(), numverts,
keep_all(), boost::make_property_map_function(global_to_local));
boost::graph::detail::histogram_sort_inplace
- (sources.begin(), sources.end(), m_rowstart.begin(), numverts,
+ (sources.begin(), m_rowstart.begin(), numverts,
targets.begin(), edge_props.begin(),
boost::make_property_map_function(global_to_local));
// Now targets is the correct vector (properly sorted by source) for
Modified: trunk/boost/graph/detail/histogram_sort.hpp
==============================================================================
--- trunk/boost/graph/detail/histogram_sort.hpp (original)
+++ trunk/boost/graph/detail/histogram_sort.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -148,7 +148,7 @@
typename Value1Iter,
typename KeyTransform>
void
-histogram_sort_inplace(KeyIterator key_begin, KeyIterator key_end,
+histogram_sort_inplace(KeyIterator key_begin,
RowstartIterator rowstart, // Must support numkeys + 1 elements and be precomputed
NumKeys numkeys,
Value1Iter values1,
@@ -181,7 +181,7 @@
typename Value2Iter,
typename KeyTransform>
void
-histogram_sort_inplace(KeyIterator key_begin, KeyIterator key_end,
+histogram_sort_inplace(KeyIterator key_begin,
RowstartIterator rowstart, // Must support numkeys + 1 elements and be precomputed
NumKeys numkeys,
Value1Iter values1,
Modified: trunk/boost/graph/dominator_tree.hpp
==============================================================================
--- trunk/boost/graph/dominator_tree.hpp (original)
+++ trunk/boost/graph/dominator_tree.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -236,7 +236,7 @@
lengauer_tarjan_dominator_tree_without_dfs
(const Graph& g,
const typename graph_traits<Graph>::vertex_descriptor& entry,
- const IndexMap& indexMap,
+ const IndexMap& /*indexMap*/,
TimeMap dfnumMap, PredMap parentMap, VertexVector& verticesByDFNum,
DomTreePredMap domTreePredMap)
{
Modified: trunk/boost/graph/floyd_warshall_shortest.hpp
==============================================================================
--- trunk/boost/graph/floyd_warshall_shortest.hpp (original)
+++ trunk/boost/graph/floyd_warshall_shortest.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -159,7 +159,7 @@
template <class VertexListGraph, class DistanceMatrix,
class WeightMap, class P, class T, class R>
bool floyd_warshall_init_dispatch(const VertexListGraph& g,
- DistanceMatrix& d, WeightMap w,
+ DistanceMatrix& d, WeightMap /*w*/,
const bgl_named_params<P, T, R>& params)
{
typedef typename property_traits<WeightMap>::value_type WM;
Modified: trunk/boost/graph/geodesic_distance.hpp
==============================================================================
--- trunk/boost/graph/geodesic_distance.hpp (original)
+++ trunk/boost/graph/geodesic_distance.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -83,7 +83,7 @@
template <typename Graph, typename DistanceMap>
inline mean_graph_distance_measure<Graph, typename property_traits<DistanceMap>::value_type>
-measure_graph_mean_geodesic(const Graph& g, DistanceMap dist)
+measure_graph_mean_geodesic(const Graph&, DistanceMap)
{
typedef typename property_traits<DistanceMap>::value_type T;
return mean_graph_distance_measure<Graph, T>();
Modified: trunk/boost/graph/grid_graph.hpp
==============================================================================
--- trunk/boost/graph/grid_graph.hpp (original)
+++ trunk/boost/graph/grid_graph.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -208,7 +208,7 @@
const Graph* m_graph;
};
- }; // namespace detail
+ } // namespace detail
//===========
// Grid Graph
Modified: trunk/boost/graph/howard_cycle_ratio.hpp
==============================================================================
--- trunk/boost/graph/howard_cycle_ratio.hpp (original)
+++ trunk/boost/graph/howard_cycle_ratio.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -173,8 +173,8 @@
virtual ~mcr_howard() {}
protected:
- virtual void store_critical_edge(edge_t ed, critical_cycle_t &cc) {}
- virtual void store_critical_cycle(critical_cycle_t &cc) {}
+ virtual void store_critical_edge(edge_t, critical_cycle_t &) {}
+ virtual void store_critical_cycle(critical_cycle_t &) {}
private:
/*!
Modified: trunk/boost/graph/is_straight_line_drawing.hpp
==============================================================================
--- trunk/boost/graph/is_straight_line_drawing.hpp (original)
+++ trunk/boost/graph/is_straight_line_drawing.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -100,7 +100,7 @@
>
bool is_straight_line_drawing(const Graph& g,
GridPositionMap drawing,
- VertexIndexMap vm
+ VertexIndexMap
)
{
Modified: trunk/boost/graph/isomorphism.hpp
==============================================================================
--- trunk/boost/graph/isomorphism.hpp (original)
+++ trunk/boost/graph/isomorphism.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -90,7 +90,7 @@
void discover_vertex(vertex1_t v, const Graph1&) const {
vertices.push_back(v);
}
- void examine_edge(edge1_t e, const Graph1& G1) const {
+ void examine_edge(edge1_t e, const Graph1&) const {
edges.push_back(e);
}
std::vector<vertex1_t>& vertices;
Modified: trunk/boost/graph/labeled_graph.hpp
==============================================================================
--- trunk/boost/graph/labeled_graph.hpp (original)
+++ trunk/boost/graph/labeled_graph.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -141,7 +141,7 @@
// Tag dispatch on unique associative containers (i.e. maps).
template <typename Container, typename Graph, typename Label, typename Prop>
std::pair<typename graph_traits<Graph>::vertex_descriptor, bool>
- insert_labeled_vertex(Container& c, Graph& g, Label const& l, Prop const& p,
+ insert_labeled_vertex(Container& c, Graph& g, Label const& l, Prop const&,
unique_associative_container_tag)
{
// Here, we actually have to try the insertion first, and only add
Modified: trunk/boost/graph/max_cardinality_matching.hpp
==============================================================================
--- trunk/boost/graph/max_cardinality_matching.hpp (original)
+++ trunk/boost/graph/max_cardinality_matching.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -67,7 +67,7 @@
template <typename Graph, typename MateMap, typename VertexIndexMap>
- bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap vm)
+ bool is_a_matching(const Graph& g, MateMap mate, VertexIndexMap)
{
typedef typename graph_traits<Graph>::vertex_descriptor
vertex_descriptor_t;
@@ -106,13 +106,13 @@
typename VertexIndexMap = dummy_property_map>
struct no_augmenting_path_finder
{
- no_augmenting_path_finder(const Graph& g, MateMap mate, VertexIndexMap vm)
+ no_augmenting_path_finder(const Graph&, MateMap, VertexIndexMap)
{ }
inline bool augment_matching() { return false; }
template <typename PropertyMap>
- void get_current_matching(PropertyMap p) {}
+ void get_current_matching(PropertyMap) {}
};
@@ -673,13 +673,13 @@
}
template <class Vertex, class Graph>
- void start_vertex(Vertex v, Graph&)
+ void start_vertex(Vertex, Graph&)
{
m_parity = false;
}
template <class Vertex, class Graph>
- void discover_vertex(Vertex u, Graph&)
+ void discover_vertex(Vertex, Graph&)
{
m_parity = !m_parity;
m_parity ? ++m_count : --m_count;
@@ -703,7 +703,7 @@
struct no_matching_verifier
{
inline static bool
- verify_matching(const Graph& g, MateMap mate, VertexIndexMap vm)
+ verify_matching(const Graph&, MateMap, VertexIndexMap)
{ return true;}
};
Modified: trunk/boost/graph/mcgregor_common_subgraphs.hpp
==============================================================================
--- trunk/boost/graph/mcgregor_common_subgraphs.hpp (original)
+++ trunk/boost/graph/mcgregor_common_subgraphs.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -89,7 +89,7 @@
template <typename ItemFirst,
typename ItemSecond>
- bool operator()(const ItemFirst& item1, const ItemSecond& item2) {
+ bool operator()(const ItemFirst&, const ItemSecond&) {
return (true);
}
};
@@ -113,7 +113,7 @@
(const GraphFirst& graph1,
const GraphSecond& graph2,
CorrespondenceMapFirstToSecond correspondence_map_1_to_2,
- CorrespondenceMapSecondToFirst correspondence_map_2_to_1,
+ CorrespondenceMapSecondToFirst /*correspondence_map_2_to_1*/,
typename graph_traits<GraphFirst>::vertices_size_type subgraph_size,
typename graph_traits<GraphFirst>::vertex_descriptor new_vertex1,
typename graph_traits<GraphSecond>::vertex_descriptor new_vertex2,
Modified: trunk/boost/graph/metric_tsp_approx.hpp
==============================================================================
--- trunk/boost/graph/metric_tsp_approx.hpp (original)
+++ trunk/boost/graph/metric_tsp_approx.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -68,11 +68,11 @@
PreorderTraverser(std::vector<Node>& p) : path_(p) {}
- void preorder(Node n, const Tree& t)
+ void preorder(Node n, const Tree&)
{ path_.push_back(n); }
- void inorder(Node n, const Tree& t) const {}
- void postorder(Node, const Tree& t) const {}
+ void inorder(Node, const Tree&) const {}
+ void postorder(Node, const Tree&) const {}
const_iterator begin() const { return path_.begin(); }
const_iterator end() const { return path_.end(); }
@@ -241,7 +241,7 @@
{ }
template <typename Vertex, typename Graph>
- void visit_vertex(Vertex v, const Graph& g)
+ void visit_vertex(Vertex v, const Graph&)
{
BOOST_CONCEPT_ASSERT((OutputIterator<OutItr, Vertex>));
*itr_++ = v;
Modified: trunk/boost/graph/named_function_params.hpp
==============================================================================
--- trunk/boost/graph/named_function_params.hpp (original)
+++ trunk/boost/graph/named_function_params.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -383,13 +383,13 @@
template <typename ArgType, typename Prop, typename Graph, bool Exists>
struct override_const_property_t {
typedef ArgType result_type;
- result_type operator()(const Graph& g, const typename boost::add_reference<ArgType>::type a) const {return a;}
+ result_type operator()(const Graph&, const typename boost::add_reference<ArgType>::type a) const {return a;}
};
template <typename ArgType, typename Prop, typename Graph>
struct override_const_property_t<ArgType, Prop, Graph, false> {
typedef typename boost::property_map<Graph, Prop>::const_type result_type;
- result_type operator()(const Graph& g, const ArgType& a) const {return get(Prop(), g);}
+ result_type operator()(const Graph& g, const ArgType&) const {return get(Prop(), g);}
};
template <typename ArgPack, typename Tag, typename Prop, typename Graph>
@@ -399,7 +399,7 @@
Graph,
boost::detail::parameter_exists<ArgPack, Tag>::value
>::result_type
- override_const_property(const ArgPack& ap, const boost::parameter::keyword<Tag>& t, const Graph& g, Prop prop) {
+ override_const_property(const ArgPack& ap, const boost::parameter::keyword<Tag>& t, const Graph& g, Prop) {
return override_const_property_t<
typename boost::parameter::value_type<ArgPack, Tag, int>::type,
Prop,
Modified: trunk/boost/graph/planar_detail/boyer_myrvold_impl.hpp
==============================================================================
--- trunk/boost/graph/planar_detail/boyer_myrvold_impl.hpp (original)
+++ trunk/boost/graph/planar_detail/boyer_myrvold_impl.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -104,7 +104,7 @@
}
template <typename Vertex, typename Graph>
- void finish_vertex(const Vertex& u, Graph& g)
+ void finish_vertex(const Vertex& u, Graph&)
{
typedef typename graph_traits<Graph>::vertices_size_type v_size_t;
@@ -889,7 +889,7 @@
}
- void add_to_merge_points(vertex_t v, graph::detail::no_old_handles) {}
+ void add_to_merge_points(vertex_t, graph::detail::no_old_handles) {}
void add_to_merge_points(vertex_t v, graph::detail::store_old_handles)
{
@@ -897,7 +897,7 @@
}
- void add_to_embedded_edges(edge_t e, graph::detail::no_old_handles) {}
+ void add_to_embedded_edges(edge_t, graph::detail::no_old_handles) {}
void add_to_embedded_edges(edge_t e, graph::detail::store_old_handles)
{
Modified: trunk/boost/graph/planar_face_traversal.hpp
==============================================================================
--- trunk/boost/graph/planar_face_traversal.hpp (original)
+++ trunk/boost/graph/planar_face_traversal.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -29,11 +29,11 @@
{}
template <typename Edge>
- void next_edge(Edge e)
+ void next_edge(Edge)
{}
template <typename Vertex>
- void next_vertex(Vertex v)
+ void next_vertex(Vertex)
{}
void end_face()
Modified: trunk/boost/graph/property_maps/constant_property_map.hpp
==============================================================================
--- trunk/boost/graph/property_maps/constant_property_map.hpp (original)
+++ trunk/boost/graph/property_maps/constant_property_map.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -43,7 +43,7 @@
: m_value(copy.m_value)
{ }
- inline reference operator [](const key_type& v) const
+ inline reference operator [](const key_type&) const
{ return m_value; }
value_type m_value;
Modified: trunk/boost/graph/r_c_shortest_paths.hpp
==============================================================================
--- trunk/boost/graph/r_c_shortest_paths.hpp (original)
+++ trunk/boost/graph/r_c_shortest_paths.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -162,7 +162,7 @@
void r_c_shortest_paths_dispatch
( const Graph& g,
const VertexIndexMap& vertex_index_map,
- const EdgeIndexMap& edge_index_map,
+ const EdgeIndexMap& /*edge_index_map*/,
typename graph_traits<Graph>::vertex_descriptor s,
typename graph_traits<Graph>::vertex_descriptor t,
// each inner vector corresponds to a pareto-optimal path
@@ -179,7 +179,7 @@
Resource_Extension_Function& ref,
Dominance_Function& dominance,
// to specify the memory management strategy for the labels
- Label_Allocator la,
+ Label_Allocator /*la*/,
Visitor vis )
{
pareto_optimal_resource_containers.clear();
@@ -449,15 +449,15 @@
struct default_r_c_shortest_paths_visitor
{
template<class Label, class Graph>
- void on_label_popped( const Label& l, const Graph& g ) {}
+ void on_label_popped( const Label&, const Graph& ) {}
template<class Label, class Graph>
- void on_label_feasible( const Label& l, const Graph& g ) {}
+ void on_label_feasible( const Label&, const Graph& ) {}
template<class Label, class Graph>
- void on_label_not_feasible( const Label& l, const Graph& g ) {}
+ void on_label_not_feasible( const Label&, const Graph& ) {}
template<class Label, class Graph>
- void on_label_dominated( const Label& l, const Graph& g ) {}
+ void on_label_dominated( const Label&, const Graph& ) {}
template<class Label, class Graph>
- void on_label_not_dominated( const Label& l, const Graph& g ) {}
+ void on_label_not_dominated( const Label&, const Graph& ) {}
}; // default_r_c_shortest_paths_visitor
Modified: trunk/boost/graph/two_bit_color_map.hpp
==============================================================================
--- trunk/boost/graph/two_bit_color_map.hpp (original)
+++ trunk/boost/graph/two_bit_color_map.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -77,8 +77,10 @@
assert (value >= 0 && value < 4);
std::size_t byte_num = i / 4;
std::size_t bit_position = ((i % 4) * 2);
- pm.data.get()[byte_num] = (pm.data.get()[byte_num] & ~(3 << bit_position))
- | (value << bit_position);
+ pm.data.get()[byte_num] =
+ (unsigned char)
+ ((pm.data.get()[byte_num] & ~(3 << bit_position))
+ | (value << bit_position));
}
template<typename IndexMap>
Modified: trunk/libs/graph/test/astar_search_test.cpp
==============================================================================
--- trunk/libs/graph/test/astar_search_test.cpp (original)
+++ trunk/libs/graph/test/astar_search_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -98,7 +98,7 @@
public:
astar_goal_visitor(Vertex goal) : m_goal(goal) {}
template <class Graph>
- void examine_vertex(Vertex u, Graph& g) {
+ void examine_vertex(Vertex u, Graph&) {
if(u == m_goal)
throw found_goal();
}
@@ -107,7 +107,7 @@
};
-int main(int argc, char **argv)
+int main(int, char **)
{
// specify some types
Modified: trunk/libs/graph/test/basic_planarity_test.cpp
==============================================================================
--- trunk/libs/graph/test/basic_planarity_test.cpp (original)
+++ trunk/libs/graph/test/basic_planarity_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -32,7 +32,7 @@
struct NoVertexIndexUpdater
{
- template <typename Graph> void reset(Graph& g) {}
+ template <typename Graph> void reset(Graph&) {}
};
Modified: trunk/libs/graph/test/bron_kerbosch_all_cliques.cpp
==============================================================================
--- trunk/libs/graph/test/bron_kerbosch_all_cliques.cpp (original)
+++ trunk/libs/graph/test/bron_kerbosch_all_cliques.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -65,7 +65,7 @@
}
int
-main(int argc, char *argv[])
+main(int, char *[])
{
typedef undirected_graph<> Graph;
typedef directed_graph<> DiGraph;
Modified: trunk/libs/graph/test/closeness_centrality.cpp
==============================================================================
--- trunk/libs/graph/test/closeness_centrality.cpp (original)
+++ trunk/libs/graph/test/closeness_centrality.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -44,7 +44,7 @@
add_edge(v[2], v[0], g);
add_edge(v[3], v[4], g);
add_edge(v[4], v[0], g);
-};
+}
template <typename Graph>
@@ -124,7 +124,7 @@
}
int
-main(int argc, char *argv[])
+main(int, char *[])
{
typedef undirected_graph<> Graph;
typedef directed_graph<> Digraph;
Modified: trunk/libs/graph/test/clustering_coefficient.cpp
==============================================================================
--- trunk/libs/graph/test/clustering_coefficient.cpp (original)
+++ trunk/libs/graph/test/clustering_coefficient.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -40,7 +40,7 @@
add_edge(v[2], v[0], g);
add_edge(v[3], v[4], g);
add_edge(v[4], v[0], g);
-};
+}
template <typename Graph>
void test_undirected()
@@ -95,7 +95,7 @@
}
int
-main(int argc, char *argv[])
+main(int, char *[])
{
typedef undirected_graph<> Graph;
typedef directed_graph<> Digraph;
Modified: trunk/libs/graph/test/core_numbers_test.cpp
==============================================================================
--- trunk/libs/graph/test/core_numbers_test.cpp (original)
+++ trunk/libs/graph/test/core_numbers_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -54,7 +54,7 @@
make_iterator_property_map(core_nums.begin(), get(vertex_index,G)));
for (size_t i=0; i<num_vertices(G); ++i) {
- printf("vertex %3zu : %i\n", i, core_nums[i]);
+ printf("vertex %3lu : %i\n", (unsigned long)i, core_nums[i]);
}
int correct[21]={1,2,2,3,3,3,3,3,2,3,2,1,1,3,3,0,2,2,2,2,1};
@@ -85,7 +85,7 @@
make_iterator_property_map(core_nums.begin(), get(vertex_index,G)));
for (size_t i=0; i<num_vertices(G); ++i) {
- printf("vertex %3zu : %i\n", i, core_nums[i]);
+ printf("vertex %3lu : %i\n", (unsigned long)i, core_nums[i]);
}
int correct[3]={-1,-1,-4};
@@ -114,7 +114,7 @@
make_iterator_property_map(core_nums.begin(), get(vertex_index,G)));
for (size_t i=0; i<num_vertices(G); ++i) {
- printf("vertex %3zu : %i\n", i, core_nums[i]);
+ printf("vertex %3lu : %i\n", (unsigned long)i, core_nums[i]);
}
int correct[5]={1,1,1,1,1};
@@ -126,7 +126,7 @@
return 0;
}
-int main(int argc, char **argv) {
+int main(int, char **) {
int nfail = 0, ntotal = 0;
int rval;
Modified: trunk/libs/graph/test/csr_graph_test.cpp
==============================================================================
--- trunk/libs/graph/test/csr_graph_test.cpp (original)
+++ trunk/libs/graph/test/csr_graph_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -442,7 +442,7 @@
int test_main(int argc, char* argv[])
{
// Optionally accept a seed value
- int seed = std::time(0);
+ int seed = int(std::time(0));
if (argc > 1) seed = boost::lexical_cast<int>(argv[1]);
std::cout << "Seed = " << seed << std::endl;
Modified: trunk/libs/graph/test/degree_centrality.cpp
==============================================================================
--- trunk/libs/graph/test/degree_centrality.cpp (original)
+++ trunk/libs/graph/test/degree_centrality.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -35,7 +35,7 @@
add_edge(v[2], v[0], g);
add_edge(v[3], v[4], g);
add_edge(v[4], v[0], g);
-};
+}
template <typename Graph>
void test_undirected()
@@ -112,7 +112,7 @@
}
int
-main(int argc, char *argv[])
+main(int, char *[])
{
typedef undirected_graph<> Graph;
typedef directed_graph<> Digraph;
Modified: trunk/libs/graph/test/dfs.cpp
==============================================================================
--- trunk/libs/graph/test/dfs.cpp (original)
+++ trunk/libs/graph/test/dfs.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -31,15 +31,15 @@
m_discover_time(d), m_finish_time(f), m_time(0) { }
template <class Vertex, class Graph>
- void initialize_vertex(Vertex u, Graph& g) {
+ void initialize_vertex(Vertex u, Graph&) {
BOOST_CHECK( boost::get(m_color, u) == Color::white() );
}
template <class Vertex, class Graph>
- void start_vertex(Vertex u, Graph& g) {
+ void start_vertex(Vertex u, Graph&) {
BOOST_CHECK( boost::get(m_color, u) == Color::white() );
}
template <class Vertex, class Graph>
- void discover_vertex(Vertex u, Graph& g) {
+ void discover_vertex(Vertex u, Graph&) {
using namespace boost;
BOOST_CHECK( get(m_color, u) == Color::gray() );
BOOST_CHECK( get(m_color, get(m_parent, u)) == Color::gray() );
@@ -69,7 +69,7 @@
BOOST_CHECK( get(m_color, target(e, g)) == Color::black() );
}
template <class Vertex, class Graph>
- void finish_vertex(Vertex u, Graph& g) {
+ void finish_vertex(Vertex u, Graph&) {
using namespace boost;
BOOST_CHECK( get(m_color, u) == Color::black() );
Modified: trunk/libs/graph/test/dominator_tree_test.cpp
==============================================================================
--- trunk/libs/graph/test/dominator_tree_test.cpp (original)
+++ trunk/libs/graph/test/dominator_tree_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -294,4 +294,4 @@
}
return 0;
-};
+}
Modified: trunk/libs/graph/test/eccentricity.cpp
==============================================================================
--- trunk/libs/graph/test/eccentricity.cpp (original)
+++ trunk/libs/graph/test/eccentricity.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -44,7 +44,7 @@
add_edge(v[2], v[0], g);
add_edge(v[3], v[4], g);
add_edge(v[4], v[0], g);
-};
+}
template <typename Graph>
@@ -134,7 +134,7 @@
int
-main(int argc, char *argv[])
+main(int, char *[])
{
typedef undirected_graph<> Graph;
typedef directed_graph<> Digraph;
Modified: trunk/libs/graph/test/grid_graph_cc.cpp
==============================================================================
--- trunk/libs/graph/test/grid_graph_cc.cpp (original)
+++ trunk/libs/graph/test/grid_graph_cc.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -14,7 +14,7 @@
#define DIMENSIONS 3
using namespace boost;
-int main (int argc, char* argv[]) {
+int main (int, char*[]) {
typedef grid_graph<DIMENSIONS> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
@@ -30,4 +30,4 @@
function_requires<ReadablePropertyGraphConcept<Graph, Edge, edge_index_t> >();
return (0);
-};
+}
Modified: trunk/libs/graph/test/grid_graph_test.cpp
==============================================================================
--- trunk/libs/graph/test/grid_graph_test.cpp (original)
+++ trunk/libs/graph/test/grid_graph_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -110,7 +110,7 @@
for (int dimension_index = 0;
dimension_index < DIMENSIONS;
++dimension_index) {
- BOOST_REQUIRE((current_vertex[dimension_index] >= 0) &&
+ BOOST_REQUIRE(/*(current_vertex[dimension_index] >= 0) && */ // Always true
(current_vertex[dimension_index] < lengths[dimension_index]));
}
@@ -194,8 +194,8 @@
get(boost::vertex_index, graph, target(current_edge, graph));
BOOST_REQUIRE(source_index != target_index);
- BOOST_REQUIRE((source_index >= 0) && (source_index < num_vertices(graph)));
- BOOST_REQUIRE((target_index >= 0) && (target_index < num_vertices(graph)));
+ BOOST_REQUIRE(/* (source_index >= 0) : always true && */ (source_index < num_vertices(graph)));
+ BOOST_REQUIRE(/* (target_index >= 0) : always true && */ (target_index < num_vertices(graph)));
// Verify that the edge is listed as existing in both directions
BOOST_REQUIRE(edge(source(current_edge, graph), target(current_edge, graph), graph).second);
Modified: trunk/libs/graph/test/is_straight_line_draw_test.cpp
==============================================================================
--- trunk/libs/graph/test/is_straight_line_draw_test.cpp (original)
+++ trunk/libs/graph/test/is_straight_line_draw_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -24,7 +24,7 @@
};
-int test_main(int argc, char* argv [])
+int test_main(int, char*[])
{
typedef adjacency_list< vecS, vecS, undirectedS,
property<vertex_index_t, int>
Modified: trunk/libs/graph/test/layout_test.cpp
==============================================================================
--- trunk/libs/graph/test/layout_test.cpp (original)
+++ trunk/libs/graph/test/layout_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -108,8 +108,8 @@
template<typename Graph>
bool operator()(double delta_p,
- typename boost::graph_traits<Graph>::vertex_descriptor p,
- const Graph& g,
+ typename boost::graph_traits<Graph>::vertex_descriptor /*p*/,
+ const Graph& /*g*/,
bool global)
{
if (global) {
Modified: trunk/libs/graph/test/make_bicon_planar_test.cpp
==============================================================================
--- trunk/libs/graph/test/make_bicon_planar_test.cpp (original)
+++ trunk/libs/graph/test/make_bicon_planar_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -62,7 +62,7 @@
struct NoVertexIndexUpdater
{
- template <typename Graph> void update(Graph& g) {}
+ template <typename Graph> void update(Graph&) {}
};
Modified: trunk/libs/graph/test/make_maximal_planar_test.cpp
==============================================================================
--- trunk/libs/graph/test/make_maximal_planar_test.cpp (original)
+++ trunk/libs/graph/test/make_maximal_planar_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -64,7 +64,7 @@
struct NoVertexIndexUpdater
{
- template <typename Graph> void update(Graph& g) {}
+ template <typename Graph> void update(Graph&) {}
};
Modified: trunk/libs/graph/test/matching_test.cpp
==============================================================================
--- trunk/libs/graph/test/matching_test.cpp (original)
+++ trunk/libs/graph/test/matching_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -37,7 +37,7 @@
template <typename Graph>
struct vertex_index_installer
{
- static void install(Graph& g) {}
+ static void install(Graph&) {}
};
@@ -346,7 +346,7 @@
-int test_main(int argc, char* argv[])
+int test_main(int, char*[])
{
matching_test<undirected_graph>(10, "adjacency_list (using vectors)");
Modified: trunk/libs/graph/test/mcgregor_subgraphs_test.cpp
==============================================================================
--- trunk/libs/graph/test/mcgregor_subgraphs_test.cpp (original)
+++ trunk/libs/graph/test/mcgregor_subgraphs_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -192,8 +192,8 @@
template <typename CorrespondenceMapFirstToSecond,
typename CorrespondenceMapSecondToFirst>
bool operator()(CorrespondenceMapFirstToSecond correspondence_map_1_to_2,
- CorrespondenceMapSecondToFirst correspondence_map_2_to_1,
- typename graph_traits<Graph>::vertices_size_type subgraph_size) {
+ CorrespondenceMapSecondToFirst /*correspondence_map_2_to_1*/,
+ typename graph_traits<Graph>::vertices_size_type /*subgraph_size*/) {
typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
Modified: trunk/libs/graph/test/mean_geodesic.cpp
==============================================================================
--- trunk/libs/graph/test/mean_geodesic.cpp (original)
+++ trunk/libs/graph/test/mean_geodesic.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -44,7 +44,7 @@
add_edge(v[2], v[0], g);
add_edge(v[3], v[4], g);
add_edge(v[4], v[0], g);
-};
+}
template <typename Graph>
@@ -132,7 +132,7 @@
int
-main(int argc, char *argv[])
+main(int, char *[])
{
typedef undirected_graph<> Graph;
typedef directed_graph<> Digraph;
Modified: trunk/libs/graph/test/metric_tsp_approx.cpp
==============================================================================
--- trunk/libs/graph/test/metric_tsp_approx.cpp (original)
+++ trunk/libs/graph/test/metric_tsp_approx.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -42,7 +42,7 @@
const PointContainer& points,
WeightMap wmap, // Property maps passed by value
VertexIndexMap vmap, // Property maps passed by value
- int sz)
+ int /*sz*/)
{
using namespace boost;
using namespace std;
Modified: trunk/libs/graph/test/named_vertices_test.cpp
==============================================================================
--- trunk/libs/graph/test/named_vertices_test.cpp (original)
+++ trunk/libs/graph/test/named_vertices_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -58,7 +58,7 @@
typedef adjacency_list<vecS, vecS, directedS, City> RoadMap;
typedef graph_traits<RoadMap>::vertex_descriptor Vertex;
-int test_main(int argc, char* argv[])
+int test_main(int, char*[])
{
RoadMap map;
Modified: trunk/libs/graph/test/r_c_shortest_paths_test.cpp
==============================================================================
--- trunk/libs/graph/test/r_c_shortest_paths_test.cpp (original)
+++ trunk/libs/graph/test/r_c_shortest_paths_test.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -199,7 +199,7 @@
};
// end data structures for shortest path problem with time windows (spptw)
-int test_main(int argc, char* argv[])
+int test_main(int, char*[])
{
SPPRC_Example_Graph g;
add_vertex( SPPRC_Example_Graph_Vert_Prop( 0, 0, 1000000000 ), g );
Modified: trunk/libs/graph/test/serialize.cpp
==============================================================================
--- trunk/libs/graph/test/serialize.cpp (original)
+++ trunk/libs/graph/test/serialize.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -21,7 +21,7 @@
std::string name;
template<class Archive>
- void serialize(Archive & ar, const unsigned int version) {
+ void serialize(Archive & ar, const unsigned int /*version*/) {
ar & BOOST_SERIALIZATION_NVP(name);
}
};
@@ -30,7 +30,7 @@
std::string name;
template<class Archive>
- void serialize(Archive & ar, const unsigned int version) {
+ void serialize(Archive & ar, const unsigned int /*version*/) {
ar & BOOST_SERIALIZATION_NVP(name);
}
};
Modified: trunk/libs/graph/test/subgraph.cpp
==============================================================================
--- trunk/libs/graph/test/subgraph.cpp (original)
+++ trunk/libs/graph/test/subgraph.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -18,7 +18,7 @@
// UNDER CONSTRUCTION
-int test_main(int argc, char* argv[])
+int test_main(int, char*[])
{
using namespace boost;
typedef adjacency_list<vecS, vecS, bidirectionalS,
Modified: trunk/libs/graph/test/subgraph_bundled.cpp
==============================================================================
--- trunk/libs/graph/test/subgraph_bundled.cpp (original)
+++ trunk/libs/graph/test/subgraph_bundled.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -42,7 +42,7 @@
typedef graph_traits<Subgraph>::vertex_iterator VertexIter;
typedef graph_traits<Subgraph>::edge_iterator EdgeIter;
-int test_main(int argc, char* argv[])
+int test_main(int, char*[])
{
mt19937 gen;
for (int t = 0; t < 100; t += 5) {
Modified: trunk/libs/graph/test/test_construction.hpp
==============================================================================
--- trunk/libs/graph/test/test_construction.hpp (original)
+++ trunk/libs/graph/test/test_construction.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -62,7 +62,7 @@
{ }
template <typename Graph>
-void build_property_graph(Graph const& g, boost::mpl::true_, boost::mpl::false_) {
+void build_property_graph(Graph const&, boost::mpl::true_, boost::mpl::false_) {
using namespace boost;
BOOST_CONCEPT_ASSERT((VertexMutablePropertyGraphConcept<Graph>));
typedef typename vertex_property<Graph>::type VertexProp;
Modified: trunk/libs/graph/test/test_destruction.hpp
==============================================================================
--- trunk/libs/graph/test/test_destruction.hpp (original)
+++ trunk/libs/graph/test/test_destruction.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -15,7 +15,7 @@
//@{
// This will basically catch adjacency matrices, which don't get torn down.
template <typename Graph, typename VertexSet, typename Remove, typename Label>
-void destroy_graph(Graph& g, VertexSet const& verts, Remove, Label)
+void destroy_graph(Graph&, VertexSet const&, Remove, Label)
{ }
// This matches MutableGraph, so just remove a vertex and then clear.
@@ -33,7 +33,7 @@
// This will match labeled graphs.
template <typename Graph, typename VertexSet>
-void destroy_graph(Graph& g, VertexSet const& verts, boost::mpl::false_, boost::mpl::true_) {
+void destroy_graph(Graph& g, VertexSet const&, boost::mpl::false_, boost::mpl::true_) {
using namespace boost;
BOOST_CONCEPT_ASSERT((VertexListGraphConcept<Graph>));
// function_requires< VeretexMutableGraphConcept<Graph> >();
@@ -84,7 +84,7 @@
}
template <typename Graph, typename VertexSet>
-void disconnect_graph(Graph& g, VertexSet const& verts, boost::mpl::true_) {
+void disconnect_graph(Graph& g, VertexSet const&, boost::mpl::true_) {
using namespace boost;
BOOST_CONCEPT_ASSERT((EdgeListGraphConcept<Graph>));
// BOOST_CONCEPT_ASSERT((EdgeMutableGraphConcept<Graph>));
Modified: trunk/libs/graph/test/test_direction.hpp
==============================================================================
--- trunk/libs/graph/test/test_direction.hpp (original)
+++ trunk/libs/graph/test/test_direction.hpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -49,7 +49,7 @@
}
template <typename Graph, typename VertexSet>
-void test_outdirected_graph(Graph const& g, VertexSet const& verts, boost::mpl::false_)
+void test_outdirected_graph(Graph const&, VertexSet const&, boost::mpl::false_)
{ }
//@}
@@ -88,7 +88,7 @@
}
template <typename Graph, typename VertexSet>
-void test_indirected_graph(Graph const& g, VertexSet const& verts, boost::mpl::false_)
+void test_indirected_graph(Graph const&, VertexSet const&, boost::mpl::false_)
{ }
//@}
@@ -122,7 +122,7 @@
}
template <typename Graph, typename VertexSet>
-void test_undirected_graph(Graph const& g, VertexSet const& verts, boost::mpl::false_)
+void test_undirected_graph(Graph const&, VertexSet const&, boost::mpl::false_)
{ }
//@}
Modified: trunk/libs/graph/test/tiernan_all_cycles.cpp
==============================================================================
--- trunk/libs/graph/test/tiernan_all_cycles.cpp (original)
+++ trunk/libs/graph/test/tiernan_all_cycles.cpp 2009-11-10 11:54:01 EST (Tue, 10 Nov 2009)
@@ -66,7 +66,7 @@
}
int
-main(int argc, char *argv[])
+main(int, char *[])
{
typedef undirected_graph<> Graph;
typedef directed_graph<> DiGraph;
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk