Silence eccentricity warnings in iFUB diameter test (#491)

The iFUB diameter test generates random sparse Erdos-Renyi graphs that
are often disconnected. The naive diameter reference implementation calls
eccentricity on every vertex, which emits a "Infinite path length
detected" warning per unreachable vertex -- producing ~2300 warnings per
test run. Wrap the loop in `with_logger(NullLogger())` to suppress them.

Co-authored-by: Stefan Krastanov <stefan@krastanov.org>
Co-authored-by: Claude Opus 4.6 <noreply@anthropic.com>

Author: 3 people

test/Project.toml

@@ -9,6 +9,7 @@ Documenter = "e30172f5-a6a5-5a46-863b-614d45cd2de4"
 Inflate = "d25df0c9-e2be-5dd7-82c8-3ad0b3e990b9"
 JET = "c3a54625-cd67-489e-a8e7-0a5a0ff4e31b"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
+Logging = "56ddb016-857b-54e1-b83d-db4d58db5568"
 Pkg = "44cfe95a-1eb2-52ea-b672-e2afdf69b78f"
 Random = "9a3f8284-a2c9-5f02-9a11-845980a1fd5c"
 SharedArrays = "1a1011a3-84de-559e-8e89-a11a2f7dc383"

test/distance.jl

@@ -81,37 +81,41 @@
 
         NUM_SAMPLES = 50 # Adjust this to change test duration
 
-        for i in 1:NUM_SAMPLES
-            # Random unweighted Graphs
-            n = rand(10:1000) # Small to Medium size graphs
-            p = rand() * 0.1 + 0.005 # Sparse to medium density
-
-            # Undirected Graphs
-            g = erdos_renyi(n, p)
-            @test diameter(g) == diameter_naive(g)
-
-            ccs = connected_components(g)
-            largest_component = ccs[argmax(length.(ccs))]
-            g_lscc, _ = induced_subgraph(g, largest_component)
-
-            if nv(g_lscc) > 1
-                d_new = @inferred diameter(g_lscc)
-                d_ref = diameter_naive(g_lscc)
-                @test d_new == d_ref
-            end
-
-            # Directed Graphs
-            g_dir = erdos_renyi(n, p, is_directed=true)
-            @test diameter(g_dir) == diameter_naive(g_dir)
-
-            sccs = strongly_connected_components(g_dir)
-            largest_component_directed = sccs[argmax(length.(sccs))]
-            g_dir_lscc, _ = induced_subgraph(g_dir, largest_component_directed)
-
-            if nv(g_dir_lscc) > 1
-                d_new_dir = @inferred diameter(g_dir_lscc)
-                d_ref_dir = diameter_naive(g_dir_lscc)
-                @test d_new_dir == d_ref_dir
+        # Silence the many "Infinite path length detected" warnings from
+        # eccentricity on disconnected random graphs.
+        with_logger(NullLogger()) do
+            for i in 1:NUM_SAMPLES
+                # Random unweighted Graphs
+                n = rand(10:1000) # Small to Medium size graphs
+                p = rand() * 0.1 + 0.005 # Sparse to medium density
+
+                # Undirected Graphs
+                g = erdos_renyi(n, p)
+                @test diameter(g) == diameter_naive(g)
+
+                ccs = connected_components(g)
+                largest_component = ccs[argmax(length.(ccs))]
+                g_lscc, _ = induced_subgraph(g, largest_component)
+
+                if nv(g_lscc) > 1
+                    d_new = @inferred diameter(g_lscc)
+                    d_ref = diameter_naive(g_lscc)
+                    @test d_new == d_ref
+                end
+
+                # Directed Graphs
+                g_dir = erdos_renyi(n, p, is_directed=true)
+                @test diameter(g_dir) == diameter_naive(g_dir)
+
+                sccs = strongly_connected_components(g_dir)
+                largest_component_directed = sccs[argmax(length.(sccs))]
+                g_dir_lscc, _ = induced_subgraph(g_dir, largest_component_directed)
+
+                if nv(g_dir_lscc) > 1
+                    d_new_dir = @inferred diameter(g_dir_lscc)
+                    d_ref_dir = diameter_naive(g_dir_lscc)
+                    @test d_new_dir == d_ref_dir
+                end
             end
         end
     end

test/runtests.jl

@@ -11,6 +11,7 @@ using LinearAlgebra
 using DelimitedFiles
 using Base64
 using Random
+using Logging: NullLogger, with_logger
 using Statistics: mean, std
 using StableRNGs
 using Pkg