Graph Traversals

Author: Affie

src/GraphsDFG/services/GraphsDFG.jl

@@ -455,3 +455,28 @@ function findShortestPathDijkstra(  dfg::GraphsDFG,
     return dijkpath
 end
 
+export bfs_tree
+export dfs_tree
+export traverseGraphTopologicalSort
+
+function Graphs.bfs_tree(fg::GraphsDFG, s::Symbol)
+    return bfs_tree(fg.g, fg.g.labels[s])
+end
+
+function Graphs.dfs_tree(fg::GraphsDFG, s::Symbol)
+    return dfs_tree(fg.g, fg.g.labels[s])
+end
+
+"""
+    $SIGNATURES
+
+Return a topological sort of a factor graph as a vector of vertex labels in topological order.
+Starting from s::Symbol  
+"""
+function traverseGraphTopologicalSort(fg::GraphsDFG, s::Symbol, fs_tree=bfs_tree)
+    tree = fs_tree(fg, s)
+    list = topological_sort_by_dfs(tree)
+    symlist = map(s->fg.g.labels[s], list)
+    return symlist
+end
+

test/runtests.jl

@@ -90,7 +90,7 @@ if get(ENV, "IIF_TEST", "") == "true"
     using IncrementalInference
 
     apis = Vector{AbstractDFG}()
-    push!(apis, LightDFG(solverParams=SolverParams(), userId="[email protected]"))
+    push!(apis, GraphsDFG(solverParams=SolverParams(), userId="[email protected]"))
     get(ENV, "DO_CGDFG_TESTS", "false") == "true" && push!(apis, Neo4jDFG(solverParams=SolverParams(), userId="[email protected]")) 
 
     for api in apis