From 46ad50e8b208d3a2eae8591c8922cfc8456cce1c Mon Sep 17 00:00:00 2001
From: Arnaud Becheler <8360330+Becheler@users.noreply.github.com>
Date: Sat, 8 Aug 2026 09:25:37 +0200
Subject: [PATCH] fix: remove unused arguments

---
 example/astar-cities.cpp                       | 2 +-
 example/bipartite_example.cpp                  | 2 +-
 example/bron_kerbosch_clique_number.cpp        | 2 +-
 example/bron_kerbosch_print_cliques.cpp        | 2 +-
 example/canonical_ordering.cpp                 | 2 +-
 example/closeness_centrality.cpp               | 2 +-
 example/clustering_coefficient.cpp             | 2 +-
 example/cycle_ratio_example.cpp                | 2 +-
 example/degree_centrality.cpp                  | 2 +-
 example/eccentricity.cpp                       | 2 +-
 example/grid_graph_example.cpp                 | 2 +-
 example/grid_graph_properties.cpp              | 2 +-
 example/inclusive_mean_geodesic.cpp            | 2 +-
 example/incremental-components-eg.cpp          | 2 +-
 example/incremental_components.cpp             | 2 +-
 example/influence_prestige.cpp                 | 2 +-
 example/kuratowski_subgraph.cpp                | 2 +-
 example/make_biconnected_planar.cpp            | 2 +-
 example/make_connected.cpp                     | 2 +-
 example/make_maximal_planar.cpp                | 2 +-
 example/mcgregor_subgraphs_example.cpp         | 2 +-
 example/mean_geodesic.cpp                      | 2 +-
 example/planar_face_traversal.cpp              | 2 +-
 example/scaled_closeness_centrality.cpp        | 2 +-
 example/simple_planarity_test.cpp              | 2 +-
 example/straight_line_drawing.cpp              | 2 +-
 example/tiernan_girth_circumference.cpp        | 2 +-
 example/tiernan_print_cycles.cpp               | 2 +-
 example/two_graphs_common_spanning_trees.cpp   | 2 +-
 example/weighted_matching_example.cpp          | 2 +-
 test/bipartite_test.cpp                        | 2 +-
 test/delete_edge.cpp                           | 2 +-
 test/generator_test.cpp                        | 2 +-
 test/graphml_test.cpp                          | 2 +-
 test/min_degree_empty.cpp                      | 2 +-
 test/subgraph_props.cpp                        | 2 +-
 test/transitive_closure_test2.cpp              | 2 +-
 test/two_graphs_common_spanning_trees_test.cpp | 2 +-
 test/vf2_sub_graph_iso_test_2.cpp              | 2 +-
 39 files changed, 39 insertions(+), 39 deletions(-)

diff --git a/example/astar-cities.cpp b/example/astar-cities.cpp
index 42d0d016a..1d79eb78a 100644
--- a/example/astar-cities.cpp
+++ b/example/astar-cities.cpp
@@ -116,7 +116,7 @@ class astar_goal_visitor : public boost::default_astar_visitor
     Vertex m_goal;
 };
 
-int main(int argc, char** argv)
+int main()
 {
 
     // specify some types
diff --git a/example/bipartite_example.cpp b/example/bipartite_example.cpp
index 9c2c78c0c..b6418bad1 100644
--- a/example/bipartite_example.cpp
+++ b/example/bipartite_example.cpp
@@ -74,7 +74,7 @@ template < typename Graph > void print_bipartite(const Graph& g)
     }
 }
 
-int main(int argc, char** argv)
+int main()
 {
     using vector_graph_t = adjacency_list< vecS, vecS, undirectedS >;
     using E = std::pair< int, int >;
diff --git a/example/bron_kerbosch_clique_number.cpp b/example/bron_kerbosch_clique_number.cpp
index f21fdcf2d..407e48d8d 100644
--- a/example/bron_kerbosch_clique_number.cpp
+++ b/example/bron_kerbosch_clique_number.cpp
@@ -22,7 +22,7 @@ using Graph = undirected_graph<>;
 using Vertex = graph_traits< Graph >::vertex_descriptor;
 using Edge = graph_traits< Graph >::edge_descriptor;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and read it from standard input.
     Graph g;
diff --git a/example/bron_kerbosch_print_cliques.cpp b/example/bron_kerbosch_print_cliques.cpp
index f656ffba9..42b3dfb16 100644
--- a/example/bron_kerbosch_print_cliques.cpp
+++ b/example/bron_kerbosch_print_cliques.cpp
@@ -50,7 +50,7 @@ using Edge = graph_traits< Graph >::edge_descriptor;
 // each vertex. This is used during graph creation.
 using NameMap = property_map< Graph, string Actor::* >::type;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and and its name map accessor.
     Graph g;
diff --git a/example/canonical_ordering.cpp b/example/canonical_ordering.cpp
index 87d99011a..3416e82af 100644
--- a/example/canonical_ordering.cpp
+++ b/example/canonical_ordering.cpp
@@ -18,7 +18,7 @@
 
 using namespace boost;
 
-int main(int argc, char** argv)
+int main()
 {
 
     using graph = adjacency_list< vecS, vecS, undirectedS,
diff --git a/example/closeness_centrality.cpp b/example/closeness_centrality.cpp
index 4181448cb..759368506 100644
--- a/example/closeness_centrality.cpp
+++ b/example/closeness_centrality.cpp
@@ -49,7 +49,7 @@ using ClosenessProperty = boost::exterior_vertex_property< Graph, float >;
 using ClosenessContainer = ClosenessProperty::container_type;
 using ClosenessMap = ClosenessProperty::map_type;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and a property map that provides access to[
     // tha actor names.
diff --git a/example/clustering_coefficient.cpp b/example/clustering_coefficient.cpp
index 4b64e1f5f..6aed5fdde 100644
--- a/example/clustering_coefficient.cpp
+++ b/example/clustering_coefficient.cpp
@@ -37,7 +37,7 @@ using ClusteringProperty = exterior_vertex_property< Graph, float >;
 using ClusteringContainer = ClusteringProperty::container_type;
 using ClusteringMap = ClusteringProperty::map_type;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and a name map that provides access to
     // then actor names.
diff --git a/example/cycle_ratio_example.cpp b/example/cycle_ratio_example.cpp
index c7a295f38..311b1b377 100644
--- a/example/cycle_ratio_example.cpp
+++ b/example/cycle_ratio_example.cpp
@@ -38,7 +38,7 @@ template < typename TG > void gen_rand_graph(TG& g, size_t nV, size_t nE)
     randomize_property< edge_weight2_t >(g, ew2rg);
 }
 
-int main(int argc, char* argv[])
+int main()
 {
     using std::cout;
     using std::endl;
diff --git a/example/degree_centrality.cpp b/example/degree_centrality.cpp
index cd249bfac..57b84192a 100644
--- a/example/degree_centrality.cpp
+++ b/example/degree_centrality.cpp
@@ -38,7 +38,7 @@ using CentralityProperty = exterior_vertex_property< Graph, unsigned >;
 using CentralityContainer = CentralityProperty::container_type;
 using CentralityMap = CentralityProperty::map_type;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and a property map that provides access
     // to the actor names.
diff --git a/example/eccentricity.cpp b/example/eccentricity.cpp
index 8577ca2c9..fdbc3f3b5 100644
--- a/example/eccentricity.cpp
+++ b/example/eccentricity.cpp
@@ -48,7 +48,7 @@ using EccentricityProperty = boost::exterior_vertex_property< Graph, int >;
 using EccentricityContainer = EccentricityProperty::container_type;
 using EccentricityMap = EccentricityProperty::map_type;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and a name map that provides access to
     // then actor names.
diff --git a/example/grid_graph_example.cpp b/example/grid_graph_example.cpp
index bd3c251b5..f4c99ef6b 100644
--- a/example/grid_graph_example.cpp
+++ b/example/grid_graph_example.cpp
@@ -24,7 +24,7 @@ void print_vertex(Traits::vertex_descriptor vertex_to_print)
               << vertex_to_print[2] << ")" << std::endl;
 }
 
-int main(int argc, char* argv[])
+int main()
 {
 
     // Define a 3x5x7 grid_graph where the second dimension doesn't wrap
diff --git a/example/grid_graph_properties.cpp b/example/grid_graph_properties.cpp
index a41968e5e..38cb75cac 100644
--- a/example/grid_graph_properties.cpp
+++ b/example/grid_graph_properties.cpp
@@ -11,7 +11,7 @@
 #include <boost/array.hpp>
 #include <boost/graph/grid_graph.hpp>
 
-int main(int argc, char* argv[])
+int main()
 {
     // A 2D grid graph
     using GraphType = boost::grid_graph< 2 >;
diff --git a/example/inclusive_mean_geodesic.cpp b/example/inclusive_mean_geodesic.cpp
index 773b031c0..4c9275eb1 100644
--- a/example/inclusive_mean_geodesic.cpp
+++ b/example/inclusive_mean_geodesic.cpp
@@ -84,7 +84,7 @@ using GeodesicMap = GeodesicProperty::map_type;
 static float exclusive_geodesics(const Graph&, DistanceMatrixMap, GeodesicMap);
 static float inclusive_geodesics(const Graph&, DistanceMatrixMap, GeodesicMap);
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph, a name map that providse abstract access
     // to the web page names, and the weight map as an accessor to
diff --git a/example/incremental-components-eg.cpp b/example/incremental-components-eg.cpp
index 54561ea96..cc88557ba 100644
--- a/example/incremental-components-eg.cpp
+++ b/example/incremental-components-eg.cpp
@@ -18,7 +18,7 @@
 
 using namespace boost;
 
-int main(int argc, char* argv[])
+int main()
 {
     using Graph = adjacency_list< vecS, vecS, undirectedS >;
     using Vertex = graph_traits< Graph >::vertex_descriptor;
diff --git a/example/incremental_components.cpp b/example/incremental_components.cpp
index f22692696..04805b16b 100644
--- a/example/incremental_components.cpp
+++ b/example/incremental_components.cpp
@@ -47,7 +47,7 @@
 
 using namespace boost;
 
-int main(int argc, char* argv[])
+int main()
 {
     using Graph = adjacency_list< vecS, vecS, undirectedS >;
     using Vertex = graph_traits< Graph >::vertex_descriptor;
diff --git a/example/influence_prestige.cpp b/example/influence_prestige.cpp
index c06a3134b..020859bd5 100644
--- a/example/influence_prestige.cpp
+++ b/example/influence_prestige.cpp
@@ -39,7 +39,7 @@ using CentralityProperty = exterior_vertex_property< Graph, unsigned >;
 using CentralityContainer = CentralityProperty::container_type;
 using CentralityMap = CentralityProperty::map_type;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and a property map that provides
     // access to the actor names.
diff --git a/example/kuratowski_subgraph.cpp b/example/kuratowski_subgraph.cpp
index 6fe19234c..484b6669f 100644
--- a/example/kuratowski_subgraph.cpp
+++ b/example/kuratowski_subgraph.cpp
@@ -18,7 +18,7 @@
 
 using namespace boost;
 
-int main(int argc, char** argv)
+int main()
 {
 
     using graph = adjacency_list< vecS, vecS, undirectedS,
diff --git a/example/make_biconnected_planar.cpp b/example/make_biconnected_planar.cpp
index dfbf1808d..bdd5d1424 100644
--- a/example/make_biconnected_planar.cpp
+++ b/example/make_biconnected_planar.cpp
@@ -19,7 +19,7 @@
 
 using namespace boost;
 
-int main(int argc, char** argv)
+int main()
 {
 
     using graph = adjacency_list< vecS, vecS, undirectedS,
diff --git a/example/make_connected.cpp b/example/make_connected.cpp
index afa1edcfe..e259e9739 100644
--- a/example/make_connected.cpp
+++ b/example/make_connected.cpp
@@ -17,7 +17,7 @@
 
 using namespace boost;
 
-int main(int argc, char** argv)
+int main()
 {
 
     using graph = adjacency_list< vecS, vecS, undirectedS,
diff --git a/example/make_maximal_planar.cpp b/example/make_maximal_planar.cpp
index b160dfd8f..27021c944 100644
--- a/example/make_maximal_planar.cpp
+++ b/example/make_maximal_planar.cpp
@@ -34,7 +34,7 @@ struct face_counter : public planar_face_traversal_visitor
     int count;
 };
 
-int main(int argc, char** argv)
+int main()
 {
 
     using graph = adjacency_list< vecS, vecS, undirectedS,
diff --git a/example/mcgregor_subgraphs_example.cpp b/example/mcgregor_subgraphs_example.cpp
index 98f82d00e..b6565ecc0 100644
--- a/example/mcgregor_subgraphs_example.cpp
+++ b/example/mcgregor_subgraphs_example.cpp
@@ -71,7 +71,7 @@ template < typename Graph > struct example_callback
     VertexSizeFirst m_max_subgraph_size;
 };
 
-int main(int argc, char* argv[])
+int main()
 {
 
     // Using a vecS graph here so that we don't have to mess around with
diff --git a/example/mean_geodesic.cpp b/example/mean_geodesic.cpp
index a99a21cb4..4192e7fbc 100644
--- a/example/mean_geodesic.cpp
+++ b/example/mean_geodesic.cpp
@@ -48,7 +48,7 @@ using GeodesicProperty = exterior_vertex_property< Graph, float >;
 using GeodesicContainer = GeodesicProperty::container_type;
 using GeodesicMap = GeodesicProperty::map_type;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and a property map that provides access
     // to the actor names.
diff --git a/example/planar_face_traversal.cpp b/example/planar_face_traversal.cpp
index 90ba2a31e..de85ad07e 100644
--- a/example/planar_face_traversal.cpp
+++ b/example/planar_face_traversal.cpp
@@ -40,7 +40,7 @@ struct edge_output_visitor : public output_visitor
     template < typename Edge > void next_edge(Edge e) { std::cout << e << " "; }
 };
 
-int main(int argc, char** argv)
+int main()
 {
 
     using graph = adjacency_list< vecS, vecS, undirectedS,
diff --git a/example/scaled_closeness_centrality.cpp b/example/scaled_closeness_centrality.cpp
index ae20c4264..a3ad245d3 100644
--- a/example/scaled_closeness_centrality.cpp
+++ b/example/scaled_closeness_centrality.cpp
@@ -75,7 +75,7 @@ using ClosenessProperty = boost::exterior_vertex_property< Graph, float >;
 using ClosenessContainer = ClosenessProperty::container_type;
 using ClosenessMap = ClosenessProperty::map_type;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and a property map that provides access
     // to the actor names.
diff --git a/example/simple_planarity_test.cpp b/example/simple_planarity_test.cpp
index 3d345b820..a4b45d59b 100644
--- a/example/simple_planarity_test.cpp
+++ b/example/simple_planarity_test.cpp
@@ -9,7 +9,7 @@
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/boyer_myrvold_planar_test.hpp>
 
-int main(int argc, char** argv)
+int main()
 {
 
     // This program illustrates a simple use of boyer_myrvold_planar_embedding
diff --git a/example/straight_line_drawing.cpp b/example/straight_line_drawing.cpp
index a425738a9..7c80373de 100644
--- a/example/straight_line_drawing.cpp
+++ b/example/straight_line_drawing.cpp
@@ -26,7 +26,7 @@ struct coord_t
     std::size_t y;
 };
 
-int main(int argc, char** argv)
+int main()
 {
     using graph = adjacency_list< vecS, vecS, undirectedS,
         property< vertex_index_t, int > >;
diff --git a/example/tiernan_girth_circumference.cpp b/example/tiernan_girth_circumference.cpp
index 81ab70ab8..df8e7cdb6 100644
--- a/example/tiernan_girth_circumference.cpp
+++ b/example/tiernan_girth_circumference.cpp
@@ -20,7 +20,7 @@ using Graph = directed_graph<>;
 using Vertex = graph_traits< Graph >::vertex_descriptor;
 using Edge = graph_traits< Graph >::edge_descriptor;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and read it from standard input.
     Graph g;
diff --git a/example/tiernan_print_cycles.cpp b/example/tiernan_print_cycles.cpp
index a0f110236..87e29b607 100644
--- a/example/tiernan_print_cycles.cpp
+++ b/example/tiernan_print_cycles.cpp
@@ -46,7 +46,7 @@ using Graph = directed_graph<>;
 using Vertex = graph_traits< Graph >::vertex_descriptor;
 using Edge = graph_traits< Graph >::edge_descriptor;
 
-int main(int argc, char* argv[])
+int main()
 {
     // Create the graph and read it from standard input.
     Graph g;
diff --git a/example/two_graphs_common_spanning_trees.cpp b/example/two_graphs_common_spanning_trees.cpp
index ebe2f05b9..8f5123302 100644
--- a/example/two_graphs_common_spanning_trees.cpp
+++ b/example/two_graphs_common_spanning_trees.cpp
@@ -32,7 +32,7 @@ using vertex_iterator = boost::graph_traits< Graph >::vertex_iterator;
 
 using edge_iterator = boost::graph_traits< Graph >::edge_iterator;
 
-int main(int argc, char** argv)
+int main()
 {
     Graph iG, vG;
     vector< edge_descriptor > iG_o = { boost::add_edge(0, 1, iG).first,
diff --git a/example/weighted_matching_example.cpp b/example/weighted_matching_example.cpp
index b716e6ef6..e6a2023d5 100644
--- a/example/weighted_matching_example.cpp
+++ b/example/weighted_matching_example.cpp
@@ -20,7 +20,7 @@ using EdgeProperty
 using my_graph
     = adjacency_list< vecS, vecS, undirectedS, no_property, EdgeProperty >;
 
-int main(int argc, const char* argv[])
+int main()
 {
     graph_traits< my_graph >::vertex_iterator vi, vi_end;
     const int n_vertices = 18;
diff --git a/test/bipartite_test.cpp b/test/bipartite_test.cpp
index f6082e299..f9444072a 100644
--- a/test/bipartite_test.cpp
+++ b/test/bipartite_test.cpp
@@ -113,7 +113,7 @@ void check_bipartite(const Graph& g, IndexMap index_map, bool is_bipartite)
     }
 }
 
-int main(int argc, char** argv)
+int main()
 {
     typedef boost::adjacency_list< boost::vecS, boost::vecS,
         boost::undirectedS >
diff --git a/test/delete_edge.cpp b/test/delete_edge.cpp
index 2abbfc764..044135630 100644
--- a/test/delete_edge.cpp
+++ b/test/delete_edge.cpp
@@ -14,7 +14,7 @@
 
 #include <boost/core/lightweight_test.hpp>
 
-int main(int argc, char* argv[])
+int main()
 {
     typedef int Vertex;
     typedef int Edge;
diff --git a/test/generator_test.cpp b/test/generator_test.cpp
index 340d1954d..9854cf020 100644
--- a/test/generator_test.cpp
+++ b/test/generator_test.cpp
@@ -20,7 +20,7 @@
 
 using namespace boost;
 
-int main(int argc, char** argv)
+int main()
 {
 
     typedef rand48 RandomGenerator;
diff --git a/test/graphml_test.cpp b/test/graphml_test.cpp
index 540fb093a..c7b7a7957 100644
--- a/test/graphml_test.cpp
+++ b/test/graphml_test.cpp
@@ -36,7 +36,7 @@
 using namespace std;
 using namespace boost;
 
-int main(int argc, char** argv)
+int main(int, char** argv)
 {
     typedef adjacency_list< vecS, vecS, directedS,
         property< vertex_color_t, int, property< vertex_name_t, string > >,
diff --git a/test/min_degree_empty.cpp b/test/min_degree_empty.cpp
index 1585742fd..1267bbf2f 100644
--- a/test/min_degree_empty.cpp
+++ b/test/min_degree_empty.cpp
@@ -16,7 +16,7 @@
 
 typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS > G;
 
-int main(int argc, char** argv)
+int main()
 {
     size_t n = 10;
     G g(n);
diff --git a/test/subgraph_props.cpp b/test/subgraph_props.cpp
index acf4a880b..5bbc859a8 100644
--- a/test/subgraph_props.cpp
+++ b/test/subgraph_props.cpp
@@ -124,7 +124,7 @@ struct TestBundles
     }
 };
 
-int main(int argc, char* argv[])
+int main()
 {
     TestProps::run();
     TestBundles::run();
diff --git a/test/transitive_closure_test2.cpp b/test/transitive_closure_test2.cpp
index 8b7127918..d70148aa7 100644
--- a/test/transitive_closure_test2.cpp
+++ b/test/transitive_closure_test2.cpp
@@ -11,7 +11,7 @@ using namespace std;
 using namespace boost;
 typedef adjacency_list<> graph_t;
 
-int main(int argc, char* argv[])
+int main()
 {
     graph_t g(5), g_TC;
 
diff --git a/test/two_graphs_common_spanning_trees_test.cpp b/test/two_graphs_common_spanning_trees_test.cpp
index 0a4609487..19bb517fe 100644
--- a/test/two_graphs_common_spanning_trees_test.cpp
+++ b/test/two_graphs_common_spanning_trees_test.cpp
@@ -100,7 +100,7 @@ void two_graphs_common_spanning_trees_test()
 
 }
 
-int main(int argc, char** argv)
+int main()
 {
     boost::two_graphs_common_spanning_trees_test();
     return boost::report_errors();
diff --git a/test/vf2_sub_graph_iso_test_2.cpp b/test/vf2_sub_graph_iso_test_2.cpp
index 437150a85..0fa9ab766 100644
--- a/test/vf2_sub_graph_iso_test_2.cpp
+++ b/test/vf2_sub_graph_iso_test_2.cpp
@@ -201,7 +201,7 @@ BOOST_TEST(!got_hit);
 }
 }
 
-int main(int argc, char* argv[])
+int main()
 {
     test_empty_graph_cases();
     test_return_value();