@@ -102,8 +102,8 @@ function rmVarFromMarg(dfg::AbstractDFG, fromvert::DFGVariable, gm::Vector{DFGFa
102102 @debug " - Removing $(fromvert. label) "
103103 for m in gm
104104 @debug " Looking at $(m. label) "
105- for n in DFG . getNeighbors (dfg, m) # x1, x2
106- if n == fromvert. label # n.label ==? x1
105+ for n in listNeighbors (dfg, m) # x1, x2
106+ if n == getLabel ( fromvert) # n.label ==? x1
107107 @debug " - Breaking link $(m. label) ->$(fromvert. label) ..."
108108 @debug " - Original links: $(DFG. ls (dfg, m)) "
109109 remvars = setdiff (DFG. ls (dfg, m), [fromvert. label])
@@ -125,7 +125,7 @@ function rmVarFromMarg(dfg::AbstractDFG, fromvert::DFGVariable, gm::Vector{DFGFa
125125 end
126126 end
127127 # Added back in chain rule.
128- if DFG. exists (dfg, m) && length (DFG . getNeighbors (dfg, m)) <= 1
128+ if DFG. exists (dfg, m) && length (listNeighbors (dfg, m)) <= 1
129129 @warn " removing vertex id=$(m. label) "
130130 DFG. deleteFactor! (dfg, m)
131131 end
@@ -149,11 +149,11 @@ function buildBayesNet!(dfg::AbstractDFG, elimorder::Vector{Symbol}; solvable::I
149149 gm = DFGFactor[]
150150
151151 vert = DFG. getVariable (dfg, v)
152- for fctId in DFG . getNeighbors (dfg, vert; solvable = solvable)
152+ for fctId in listNeighbors (dfg, vert; solvable = solvable)
153153 fct = DFG. getFactor (dfg, fctId)
154154 if (getSolverData (fct). eliminated != true )
155155 push! (fi, fctId)
156- for sepNode in DFG . getNeighbors (dfg, fct; solvable = solvable)
156+ for sepNode in listNeighbors (dfg, fct; solvable = solvable)
157157 # TODO -- validate !(sepNode.index in Si) vs. older !(sepNode in Si)
158158 if sepNode != v && ! (sepNode in Si) # Symbol comparison!
159159 push! (Si, sepNode)
0 commit comments