Fix overrides and formatting

Author: gdalle

src/overrides.jl

@@ -172,20 +172,22 @@ function Graphs.induced_subgraph(
     return newg, Vector{E}(vlist)
 end
 
-function induced_subgraph(g::T, elist::AbstractVector{U}) where T <: AbstractSimpleWeightedGraph where U <: AbstractEdge
+function Graphs.induced_subgraph(
+    g::T, elist::AbstractVector{U}
+) where {T<:AbstractSimpleWeightedGraph} where {U<:AbstractEdge}
     allunique(elist) || throw(ArgumentError("Edges in subgraph list must be unique"))
     E = eltype(g)
     vertex_set = Set{E}()
     @inbounds for e in elist
         if has_edge(g, e)
             push!(vertex_set, src(e), dst(e))
-        else 
+        else
             @warn "Skipping the edge $(e), since it does not exist in the graph!"
         end
     end
     vertex_list = collect(vertex_set)
     sort!(vertex_list)
-    index_map = Dict(vertex_list[i] => i for i=1:length(vertex_list))
+    index_map = Dict(vertex_list[i] => i for i in 1:length(vertex_list))
     n = length(vertex_list)
     new_weights = spzeros(weighttype(g), E, E(n), E(n))
     @inbounds for e in elist
@@ -197,7 +199,6 @@ function induced_subgraph(g::T, elist::AbstractVector{U}) where T <: AbstractSim
             end
         end
     end
-    newg = zero(g)
-    newg.weights = new_weights
+    newg = T(new_weights)
     return newg, Vector{edgetype(g)}(collect(edges(newg)))
 end

test/simpleweightedgraph.jl

@@ -367,9 +367,13 @@ using SparseArrays
         # test edge induced graph with one edge removed
         # graph isomorphic to C_5
         g = SimpleWeightedGraph([0 2 0 0 2; 2 0 2 0 0; 0 2 0 2 0; 0 0 2 0 2; 2 0 0 2 0])
-        expected_graph_weights = sparse([0 2 0 0 0; 2 0 2 0 0; 0 2 0 2 0; 0 0 2 0 2; 0 0 0 2 0]);
+        expected_graph_weights = sparse(
+            [0 2 0 0 0; 2 0 2 0 0; 0 2 0 2 0; 0 0 2 0 2; 0 0 0 2 0]
+        )
         # create edge induced subgraph isomorphic to P_5. The edge (1, 5) is missing and test if weights are correct.
-        edge_induced_subgraph_weights = weights(first(induced_subgraph(g, [Edge(1, 2), Edge(2, 3), Edge(3, 4), Edge(4, 5)])))
+        edge_induced_subgraph_weights = weights(
+            first(induced_subgraph(g, [Edge(1, 2), Edge(2, 3), Edge(3, 4), Edge(4, 5)]))
+        )
         @test edge_induced_subgraph_weights == expected_graph_weights
 
         # test edge induced subgraph which does not contain the whole vertex set, especially remove the first column (vertex 1)