Skip to content
Snippets Groups Projects
Commit b2ccb263 authored by Joan Vallvé Navarro's avatar Joan Vallvé Navarro
Browse files

static function

(cherry picked from commit c36bdfb6)
parent a9d87a67
No related branches found
No related tags found
1 merge request!417Resolve "Graph search"
Pipeline #6638 passed
This commit is part of merge request !417. Comments created here will be created in the context of that merge request.
......@@ -22,10 +22,23 @@ class GraphSearch
~GraphSearch();
FactorBasePtrList shortestPath(FrameBasePtr frm1, FrameBasePtr frm2, const unsigned int max_graph_dist = 0);
FactorBasePtrList computeShortestPath(FrameBasePtr frm1,
FrameBasePtr frm2,
const unsigned int max_graph_dist = 0);
std::set<FrameBasePtr> getNeighborFrames(const std::set<FrameBasePtr>& frms);
static FactorBasePtrList shortestPath(FrameBasePtr frm1,
FrameBasePtr frm2,
const unsigned int max_graph_dist = 0)
{
GraphSearch graph_search;
return graph_search.computeShortestPath(frm1, frm2, max_graph_dist);
}
};
} // namespace wolf
#endif
......@@ -13,9 +13,9 @@ GraphSearch::~GraphSearch()
}
FactorBasePtrList GraphSearch::shortestPath(FrameBasePtr frm1,
FrameBasePtr frm2,
const unsigned int max_graph_dist)
FactorBasePtrList GraphSearch::computeShortestPath(FrameBasePtr frm1,
FrameBasePtr frm2,
const unsigned int max_graph_dist)
{
std::set<FrameBasePtr> frm_neigs({frm1});
unsigned int depth = 0;
......@@ -95,3 +95,4 @@ std::set<FrameBasePtr> GraphSearch::getNeighborFrames(const std::set<FrameBasePt
return frm_neigs;
}
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment