Format scripts

Co-Authored-By: Claudio Moroni <43729990+ClaudMor@users.noreply.github.com>
Co-Authored-By: Pietro Monticone <38562595+pitmonticone@users.noreply.github.com>

Author: 3 people

src/abstractmultilayergraph.jl

@@ -168,18 +168,19 @@ function set_metadata!(
     return true
 end
 
-
 """
     add_vertex!(mg::AbstractMultilayerGraph, mv::MultilayerVertex; add_node::Bool = true)
 
 Add MultilayerVertex `mv` to multilayer graph `mg`. If `add_node` is true and `node(mv)` is not already part of `mg`, then add `node(mv)` to `mg` before adding `mv` to `mg` instead of throwing an error.
 """
-function Graphs.add_vertex!(mg::AbstractMultilayerGraph, mv::MultilayerVertex; add_node::Bool = true)
+function Graphs.add_vertex!(
+    mg::AbstractMultilayerGraph, mv::MultilayerVertex; add_node::Bool=true
+)
     _node = node(mv)
     if add_node && !has_node(mg, _node)
         add_node!(mg, _node)
     end
-    add_vertex_specialized!(mg, mv)
+    return add_vertex_specialized!(mg, mv)
 end
 
 # Edges

src/multilayerdigraph.jl

@@ -54,7 +54,6 @@ function MultilayerDiGraph(
     return multilayerdigraph
 end
 
-
 """
     MultilayerDiGraph(
         empty_layers::Vector{<:Layer{T,U}},
@@ -288,7 +287,6 @@ end
 # Multilayer-specific methods
 # "empty graph" could be the correct way of calling a graph with no edges: https://math.stackexchange.com/questions/320859/what-is-the-term-for-a-graph-on-n-vertices-with-no-edges
 
-
 # Base overloads
 """
     Base.getproperty(mg::M, f::Symbol) where { M <: MultilayerDiGraph }

src/multilayeredge.jl

@@ -57,7 +57,9 @@ end
 Convert to `MultilayerEdge{Nothing}(src, dst, nothing, metadata)`.
 """
 function MultilayerEdge(
-    src::AbstractMultilayerVertex, dst::AbstractMultilayerVertex, metadata::Union{Tuple,NamedTuple}
+    src::AbstractMultilayerVertex,
+    dst::AbstractMultilayerVertex,
+    metadata::Union{Tuple,NamedTuple},
 )
     return MultilayerEdge{Nothing}(src, dst, nothing, metadata)
 end

src/multilayergraph.jl

@@ -59,7 +59,6 @@ function MultilayerGraph(
     return multilayergraph
 end
 
-
 """
     MultilayerGraph(
         empty_layers::Vector{<:Layer{T,U}},
@@ -286,7 +285,6 @@ end
 # Multilayer-specific methods
 # "empty graph" could be the correct way of calling a graph with no edges: https://math.stackexchange.com/questions/320859/what-is-the-term-for-a-graph-on-n-vertices-with-no-edges
 
-
 # Base overloads
 """
     Base.getproperty(mg::M, f::Symbol) where { M <: MultilayerGraph }

src/subgraphs/layer.jl

@@ -197,7 +197,7 @@ function Layer(
     default_edge_weight::Function=(src, dst) -> nothing,
     default_edge_metadata::Function=(src, dst) -> NamedTuple(),
     allow_self_loops::Bool=false,
-) where {T<:Integer,U<:Real,G<:AbstractGraph{T},V<:MultilayerVertex{nothing},N<:Node} 
+) where {T<:Integer,U<:Real,G<:AbstractGraph{T},V<:MultilayerVertex{nothing},N<:Node}
     _nv = length(vertices)
     @assert(
         length(unique(vertices)) == _nv, "The argument `vertices` must be a unique list"