Merge branch 'master' into 431-is_chordal-algorithm

Author: Krastanov

.github/workflows/ci-pre.yml

@@ -26,12 +26,12 @@ jobs:
       - uses: julia-actions/setup-julia@v2
         with:
           version: pre
-      - uses: julia-actions/cache@v2
+      - uses: julia-actions/cache@v3
       - run: sed -i '/JET/d' test/Project.toml
       - uses: julia-actions/julia-buildpkg@v1
       - uses: julia-actions/julia-runtest@v1
       - uses: julia-actions/julia-processcoverage@v1
-      - uses: codecov/codecov-action@v5
+      - uses: codecov/codecov-action@v6
         with:
           files: lcov.info
           token: ${{ secrets.CODECOV_TOKEN }}

.github/workflows/ci.yml

@@ -36,11 +36,11 @@ jobs:
       - uses: julia-actions/setup-julia@v2
         with:
           version: ${{ matrix.version }}
-      - uses: julia-actions/cache@v2
+      - uses: julia-actions/cache@v3
       - uses: julia-actions/julia-buildpkg@v1
       - uses: julia-actions/julia-runtest@v1
       - uses: julia-actions/julia-processcoverage@v1
-      - uses: codecov/codecov-action@v5
+      - uses: codecov/codecov-action@v6
         with:
           files: lcov.info
           token: ${{ secrets.CODECOV_TOKEN }}

.github/workflows/downgrade.yml

@@ -25,6 +25,6 @@ jobs:
         with:
           skip: Pkg,TOML,InteractiveUtils,Random,LinearAlgebra
           julia_version: ${{ matrix.version }}
-      - uses: julia-actions/cache@v2
+      - uses: julia-actions/cache@v3
       - uses: julia-actions/julia-buildpkg@v1
       - uses: julia-actions/julia-runtest@v1

CHANGELOG.md

@@ -1,12 +1,21 @@
 # News
 
-## dev - unreleased
+We follow SemVer as most of the Julia ecosystem. Below you might see the "breaking" label even for minor version bumps -- we use it a bit more loosely to denote things that are not breaking by SemVer's definition but might cause breakage to people using internal or experimental APIs or undocumented implementation details. 
+
+## unreleased
+
+- `is_articulation(g, v)` for checking whether a single vertex is an articulation point
+- The iFUB algorithm is used for faster diameter calculation and now supports weighted graph diameter calculation
+
+## v1.14.0 - 2026-02-26
+- **(breaking)** `neighbors`, `inneighbors`, and `outneighbors` now return an immutable `FrozenVector` instead of `Vector`
 - Louvain community detection algorithm
 - Graph views: `ReverseView` and `UndirectedView` for directed graphs
 - New graph products: `strong_product`, `disjunctive_product`, `lexicographic_product`, `homomorphic_product`
 - `maximum_clique`, `clique_number`, `maximal_independent_sets`, `maximum_independent_set`, `independence_number`
 - `regular_tree` generator
 - `kruskal_mst` now accepts weight vectors
+- `is_planar` planarity test and `planar_maximally_filtered_graph` (PMFG) algorithm
 - `count_connected_components` for efficiently counting connected components without materializing them
 - `connected_components!` is now exported and accepts an optional `search_queue` argument to reduce allocations
 - `is_connected` optimized to avoid allocating component vectors

Project.toml

@@ -1,6 +1,6 @@
 name = "Graphs"
 uuid = "86223c79-3864-5bf0-83f7-82e725a168b6"
-version = "1.13.4"
+version = "1.14.0"
 
 [deps]
 ArnoldiMethod = "ec485272-7323-5ecc-a04f-4719b315124d"

benchmark/benchmarks.jl

@@ -16,6 +16,7 @@ serialbenchmarks = [
     "serial/core.jl",
     "serial/connectivity.jl",
     "serial/centrality.jl",
+    "serial/distance.jl",
     "serial/edges.jl",
     "serial/insertions.jl",
     "serial/traversals.jl",

benchmark/serial/distance.jl

@@ -0,0 +1,42 @@
+SUITE["distance"] = BenchmarkGroup()
+
+let
+    n_bench = 300
+
+    symmetric_weights(n) = (W=rand(n, n); (W + W') / 2)
+
+    # Erdős-Rényi Setup
+    p = 10 / n_bench
+    g_er = erdos_renyi(n_bench, p)
+    while !is_connected(g_er)
+        g_er = erdos_renyi(n_bench, p)
+    end
+    distmx_er = symmetric_weights(n_bench)
+
+    # Barabási-Albert Setup
+    g_ba = barabasi_albert(n_bench, 5)
+    while !is_connected(g_ba)
+        g_ba = barabasi_albert(n_bench, 5)
+    end
+    distmx_ba = symmetric_weights(n_bench)
+
+    SUITE["distance"]["weighted_diameter"] = BenchmarkGroup()
+
+    # Erdős-Rényi
+    SUITE["distance"]["weighted_diameter"]["erdos_renyi_optimized"] = @benchmarkable diameter(
+        $g_er, $distmx_er
+    )
+
+    SUITE["distance"]["weighted_diameter"]["erdos_renyi_naive"] = @benchmarkable maximum(
+        eccentricity($g_er, vertices($g_er), $distmx_er)
+    )
+
+    # Barabási-Albert
+    SUITE["distance"]["weighted_diameter"]["barabasi_albert_optimized"] = @benchmarkable diameter(
+        $g_ba, $distmx_ba
+    )
+
+    SUITE["distance"]["weighted_diameter"]["barabasi_albert_naive"] = @benchmarkable maximum(
+        eccentricity($g_ba, vertices($g_ba), $distmx_ba)
+    )
+end

docs/Project.toml

@@ -1,6 +1,8 @@
 [deps]
 Documenter = "e30172f5-a6a5-5a46-863b-614d45cd2de4"
 Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6"
+IGraphs = "647e90d3-2106-487c-adb4-c91fc07b96ea"
+NautyGraphs = "7509a0a4-015a-4167-b44b-0799a1a2605e"
 
 [compat]
 Documenter = "1"

docs/make.jl

@@ -1,5 +1,7 @@
 using Documenter
 using Graphs
+using IGraphs: IGraphs
+using NautyGraphs: NautyGraphs
 
 # same for contributing and license
 cp(
@@ -40,7 +42,11 @@ pages_files = [
         "first_steps/plotting.md",
         "first_steps/persistence.md",
     ],
-    "Ecosystem" => ["ecosystem/graphtypes.md", "ecosystem/interface.md"],
+    "Ecosystem" => [
+        "ecosystem/graphtypes.md",
+        "ecosystem/graphalgorithms.md",
+        "ecosystem/interface.md",
+    ],
     "Core API" => [
         "core_functions/core.md",
         "core_functions/interface.md",

docs/src/algorithms/spanningtrees.md

@@ -16,6 +16,8 @@ Pages = [
     "spanningtrees/boruvka.jl",
     "spanningtrees/kruskal.jl",
     "spanningtrees/prim.jl",
+    "planarity.jl",
+    "spanningtrees/planar_maximally_filtered_graph.jl",
 ]
 
 ```