Clean docstrings of MultiplexGraphs 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/abstractmultiplexdigraph.jl

@@ -209,7 +209,7 @@ end
 """
     get_graph_of_layers(mg::M) where {M <: AbstractMultiplexDiGraph}
 
-Get a [`DiGraphOfGraph`](@ref) of the layers of `mg`. the weight of each edge between layers are obtained by summing all edge weights in the corresponding interlayer. See [De Domenico et al. (2013)](https://doi.org/10.1103/PhysRevX.3.041022).
+Get a [`DiGraphOfGraph`](@ref) of the layers of `mg`. The weight of each edge between layers are obtained by summing all edge weights in the corresponding interlayer. See [De Domenico et al. (2013)](https://doi.org/10.1103/PhysRevX.3.041022).
 """
 function get_graph_of_layers(
     mg::M; normalization::String="total_edges"

src/abstractmultiplexugraph.jl

@@ -1,7 +1,7 @@
 """
     AbstractMultiplexUGraph{T,U} <: AbstractMultilayerUGraph{T,U}
 
-Abstract type representing an undirecte multiplex graph.
+Abstract type representing an undirected multiplex graph.
 """
 abstract type AbstractMultiplexUGraph{T,U} <: AbstractMultilayerUGraph{T,U} end
 
@@ -138,7 +138,7 @@ end
 """
     get_graph_of_layers(mg::M) where {M <: AbstractMultiplexUGraph}
 
-Get a [`DiGraphOfGraph`](@ref) of the layers of `mg`. the weight of each edge between layers are obtained by summing all edge weights in the corresponding interlayer. See [De Domenico et al. (2013)](https://doi.org/10.1103/PhysRevX.3.041022).
+Get a [`DiGraphOfGraph`](@ref) of the layers of `mg`. The weight of each edge between layers are obtained by summing all edge weights in the corresponding interlayer. See [De Domenico et al. (2013)](https://doi.org/10.1103/PhysRevX.3.041022).
 """
 function get_graph_of_layers(
     mg::M; normalization::String="total_edges"

src/multiplexdigraph.jl

@@ -1,7 +1,7 @@
 """
     MultiplexDiGraph{T, U, G <: AbstractGraph{T}} <: AbstractMultiplexUGraph{T,U}
 
-A concrete type that can represent a general directed MultiplexDiGraph graph. That is, a multilayer graph whos einterlayers are all trivial in the sense that they only have links between vertices that represent the same node.
+A concrete type that can represent a general directed MultiplexDiGraph graph. That is, a multilayer graph whose interlayers are all trivial in the sense that they only have links between vertices that represent the same node.
 
 # FIELDS
 

src/multiplexgraph.jl

@@ -1,7 +1,7 @@
 """
     MultiplexGraph{T, U, G <: AbstractGraph{T}} <: AbstractMultiplexUGraph{T,U}
 
-A concrete type that can represent a general undirected multiplexGraph graph. That is, a multilayer graph whos einterlayers are all trivial in the sense that they only have links between vertices that represent the same node.
+A concrete type that can represent a general undirected multiplexGraph graph. That is, a multilayer graph whose interlayers are all trivial in the sense that they only have links between vertices that represent the same node.
 
 # FIELDS