format src

Author: Krastanov

src/Experimental/Traversals/bfs.jl

@@ -1,4 +1,5 @@
-import Base.Sort, Base.Sort.Algorithm
+using Base.Sort: Sort
+using Base.Sort.Algorithm: Algorithm
 import Base: sort!
 
 struct NOOPSortAlg <: Base.Sort.Algorithm end

src/Experimental/vf2.jl

@@ -489,7 +489,7 @@ function has_induced_subgraphisomorph(
     edge_relation::Union{Nothing,Function}=nothing,
 )::Bool
     result = false
-    callback(vmap) = (result = true; return false)
+    callback(vmap) = (result=true; return false)
     vf2(
         callback,
         g1,
@@ -509,7 +509,7 @@ function has_subgraphisomorph(
     edge_relation::Union{Nothing,Function}=nothing,
 )::Bool
     result = false
-    callback(vmap) = (result = true; return false)
+    callback(vmap) = (result=true; return false)
     vf2(
         callback,
         g1,
@@ -531,7 +531,7 @@ function has_isomorph(
     !could_have_isomorph(g1, g2) && return false
 
     result = false
-    callback(vmap) = (result = true; return false)
+    callback(vmap) = (result=true; return false)
     vf2(
         callback,
         g1,
@@ -646,32 +646,3 @@ function all_subgraphisomorph(
     end
     return ch
 end
-
-#! format: off
-# Turns off formatting from this point onwards
-
-function all_isomorph(
-    g1::AbstractGraph,
-    g2::AbstractGraph,
-    alg::VF2;
-    vertex_relation::Union{Nothing,Function}=nothing,
-    edge_relation::Union{Nothing,Function}=nothing,
-)::Channel{Vector{Tuple{eltype(g1),eltype(g2)}}}
-    T = Vector{Tuple{eltype(g1),eltype(g2)}}
-    !could_have_isomorph(g1, g2) && return Channel(_ -> nothing, ctype = T)
-    make_callback(c) = vmap -> (put!(c, collect(zip(vmap, 1:length(vmap)))), return true)
-    ch::Channel{T} = Channel(; ctype=T) do c
-        vf2(
-            make_callback(c),
-            g1,
-            g2,
-            IsomorphismProblem();
-            vertex_relation=vertex_relation,
-            edge_relation=edge_relation,
-        )
-    end
-    return ch
-end
-
-#! format: on
-# Turns on formatting from this point onwards

src/SimpleGraphs/generators/randgraphs.jl

@@ -1164,7 +1164,7 @@ function stochastic_block_model(
         for b in a:K
             ((a == b) && !(c[a, b] <= n[b] - 1)) ||
                 ((a != b) && !(c[a, b] <= n[b])) && error(
-                    "Mean degree cannot be greater than available neighbors in the block.",
+                    "Mean degree cannot be greater than available neighbors in the block."
                 ) # TODO 0.7: turn into some other error?
 
             m = a == b ? div(n[a] * (n[a] - 1), 2) : n[a] * n[b]