Merge branch 'master' of https://github.com/JuliaRobotics/DistributedFactorGraphs.jl into feature/moving_isSolveInProgress

Author: GearsAD

src/DistributedFactorGraphs.jl

@@ -9,8 +9,6 @@ using Reexport
 using JSON2
 using LinearAlgebra
 using SparseArrays
-# This is used in the definition of getAdjacencyMatrixSparse
-using LightGraphs
 
 # Entities
 include("entities/AbstractDFG.jl")

src/services/AbstractDFG.jl

@@ -503,7 +503,7 @@ end
 Get an adjacency matrix for the DFG, returned as a tuple: adjmat::SparseMatrixCSC{Int}, var_labels::Vector{Symbol) fac_labels::Vector{Symbol).
 Rows are the factors, columns are the variables, with the corresponding labels in fac_labels,var_labels.
 """
-function getAdjacencyMatrixSparse(dfg::G; solvable::Int=0)::Tuple{LightGraphs.SparseMatrixCSC, Vector{Symbol}, Vector{Symbol}} where G <: AbstractDFG
+function getAdjacencyMatrixSparse(dfg::G; solvable::Int=0)::Tuple{SparseMatrixCSC, Vector{Symbol}, Vector{Symbol}} where G <: AbstractDFG
 	varLabels = map(v->v.label, getVariables(dfg, solvable=solvable))
 	factLabels = map(f->f.label, getFactors(dfg, solvable=solvable))