|
1 |
| -# using DistributedFactorGraphs, Test |
2 |
| -# testDFGAPI = LightDFG |
3 | 1 | dfg = testDFGAPI{NoSolverParams}()
|
4 | 2 |
|
5 | 3 | #add types for softtypes
|
@@ -357,12 +355,11 @@ end
|
357 | 355 | @test symdiff([:x1, :x1x2f1, :x2], [ls(dfgSubgraph)..., lsf(dfgSubgraph)...]) == []
|
358 | 356 |
|
359 | 357 | # DFG issue #201 Test include orphan factors with filtering - should only return x7 with solvable=1
|
360 |
| - dfgSubgraph = getSubgraphAroundNode(dfg, getFactor(dfg, :x6x7f1), 1, true, solvable=0) |
361 |
| - @test symdiff([:x6, :x7, :x6x7f1], [ls(dfgSubgraph)..., lsf(dfgSubgraph)...]) == [] |
| 358 | + dfgSubgraph = getSubgraphAroundNode(dfg, getFactor(dfg, :x7x8f1), 1, true, solvable=0) |
| 359 | + @test symdiff([:x7, :x8, :x7x8f1], [ls(dfgSubgraph)..., lsf(dfgSubgraph)...]) == [] |
362 | 360 | # Filter - always returns the node you start at but filters around that.
|
363 |
| - dfgSubgraph = getSubgraphAroundNode(dfg, getFactor(dfg, :x6x7f1), 1, true, solvable=1) |
364 |
| - @test symdiff([:x6x7f1, :x7], [ls(dfgSubgraph)..., lsf(dfgSubgraph)...]) == [] |
365 |
| - |
| 361 | + dfgSubgraph = getSubgraphAroundNode(dfg, getFactor(dfg, :x7x8f1), 1, true, solvable=1) |
| 362 | + @test symdiff([:x7x8f1, :x7], [ls(dfgSubgraph)..., lsf(dfgSubgraph)...]) == [] |
366 | 363 |
|
367 | 364 | # DFG issue #95 - confirming that getSubgraphAroundNode retains order
|
368 | 365 | # REF: https://github.com/JuliaRobotics/DistributedFactorGraphs.jl/issues/95
|
|
0 commit comments