Concrete implementations
SimpleGraphs
GraphsBase.SimpleGraphs.SimpleDiGraph
— Typemutable struct SimpleDiGraph{T<:Integer} <: AbstractGraph{T<:Integer, GraphsBase.SimpleGraphs.SimpleEdge{T<:Integer}}
A type representing a directed graph with unweighted, non-multiple edges.
Fields
ne::Int64
: Number of edgesfadjlist::Array{Vector{T}, 1} where T<:Integer
: Forward adjacency list such thatF[v]
contains the out-neighbors of vertexv
badjlist::Array{Vector{T}, 1} where T<:Integer
: Backward adjacency list such thatB[u]
contains the in-neighbors of vertexv
GraphsBase.SimpleGraphs.SimpleEdge
— Typestruct SimpleEdge{T<:Integer} <: AbstractEdge{T<:Integer, Int64}
A type representing an unweighted directed edge.
Fields
src::Integer
: Source of the edgedst::Integer
: Destination of the edge
GraphsBase.SimpleGraphs.SimpleGraph
— Typemutable struct SimpleGraph{T<:Integer} <: AbstractGraph{T<:Integer, GraphsBase.SimpleGraphs.SimpleEdge{T<:Integer}}
A type representing an undirected graph with unweighted, non-multiple edges.
Fields
ne::Int64
: Number of edgesadjlist::Array{Vector{T}, 1} where T<:Integer
: Adjacency list such thatL[v]
contains the neighbors of vertexv
SimpleWeightedGraphs
GraphsBase.SimpleWeightedGraphs.SimpleWeightedDiGraph
— Typestruct SimpleWeightedDiGraph{T<:Integer, W} <: AbstractGraph{T<:Integer, GraphsBase.SimpleWeightedGraphs.SimpleWeightedEdge{T<:Integer, W}}
A type representing a directed graph with weighted, non-multiple edges.
Fields
weights::SparseArrays.SparseMatrixCSC{W, T} where {T<:Integer, W}
: Transposed weighted adjacency matrix:weights[v, u]
contains the weight of edge(u, v)
GraphsBase.SimpleWeightedGraphs.SimpleWeightedEdge
— Typestruct SimpleWeightedEdge{T<:Integer, W} <: AbstractEdge{T<:Integer, W}
A type representing a weighted directed edge.
Fields
src::Integer
: Source of the edgedst::Integer
: Destination of the edgeweight::Any
: Weight of the edge
GraphsBase.SimpleWeightedGraphs.SimpleWeightedGraph
— Typestruct SimpleWeightedGraph{T<:Integer, W} <: AbstractGraph{T<:Integer, GraphsBase.SimpleWeightedGraphs.SimpleWeightedEdge{T<:Integer, W}}
A type representing an undirected graph with weighted, non-multiple edges.
Fields
weights::SparseArrays.SparseMatrixCSC{W, T} where {T<:Integer, W}
: Symmetric weighted adjacency matrix:weights[u, v]
andweights[v, u]
both contain the weight of edge{u, v}