From 30013adff16657cff97d049775fa181e0e32a159 Mon Sep 17 00:00:00 2001
From: Arnaud Becheler <8360330+Becheler@users.noreply.github.com>
Date: Mon, 22 Jun 2026 13:23:02 +0200
Subject: [PATCH] Silence -Wunused-local-typedef and -Wunused-variable in four
 examples

---
 example/graph-assoc-types.cpp                | 2 ++
 example/minimum_degree_ordering.cpp          | 1 -
 example/quick-tour.cpp                       | 1 -
 example/two_graphs_common_spanning_trees.cpp | 1 +
 4 files changed, 3 insertions(+), 2 deletions(-)

diff --git a/example/graph-assoc-types.cpp b/example/graph-assoc-types.cpp
index 03cb87910..009008e4f 100644
--- a/example/graph-assoc-types.cpp
+++ b/example/graph-assoc-types.cpp
@@ -7,6 +7,7 @@
 //=======================================================================
 #include <boost/graph/graph_traits.hpp>
 #include <boost/graph/adjacency_list.hpp>
+#include <boost/core/ignore_unused.hpp>
 
 using namespace boost;
 
@@ -21,6 +22,7 @@ template < typename Graph > void generic_foo(Graph& g)
     // Access iterator types...
     // Access size types...
     // Now do something useful...
+    boost::ignore_unused< Vertex, Edge, Dir, Par >();
 }
 
 template < typename Graph > void generic_bar(Graph& g)
diff --git a/example/minimum_degree_ordering.cpp b/example/minimum_degree_ordering.cpp
index 0b22ea5f2..19259bba9 100644
--- a/example/minimum_degree_ordering.cpp
+++ b/example/minimum_degree_ordering.cpp
@@ -42,7 +42,6 @@ struct harwell_boeing
 {
     harwell_boeing(char* filename)
     {
-        int Nrhs;
         char* Type;
         Type = new char[4];
         isComplex = false;
diff --git a/example/quick-tour.cpp b/example/quick-tour.cpp
index 63cb561fa..226c52a55 100644
--- a/example/quick-tour.cpp
+++ b/example/quick-tour.cpp
@@ -31,7 +31,6 @@ template < typename Graph, typename VertexNameMap >
 void print_vertex_names(const Graph& g, VertexNameMap name_map)
 {
     std::cout << "vertices(g) = { ";
-    using iter_t = typename graph_traits< Graph >::vertex_iterator;
     for (auto p = vertices(g); p.first != p.second; ++p.first)
     {
         print_vertex_name(*p.first, name_map);
diff --git a/example/two_graphs_common_spanning_trees.cpp b/example/two_graphs_common_spanning_trees.cpp
index 95c161174..ebe2f05b9 100644
--- a/example/two_graphs_common_spanning_trees.cpp
+++ b/example/two_graphs_common_spanning_trees.cpp
@@ -57,6 +57,7 @@ int main(int argc, char** argv)
     for (auto const & vec : coll)
     {
         // Here you can play with the trees that the algorithm has found.
+        (void) vec;
     }
 
     return 0;