06dac43cae
1. Skip subtrees that have already been visited when searching for dependent cliques; 2. Avoid copying shared_ptrs (which needs extra expensive atomic operations) in the searching. Use const Clique* instead of sharedClique whenever possible; 3. Use std::unordered_set instead of std::set to improve average searching speed. |
||
|---|---|---|
| .. | ||
| tests | ||
| BatchFixedLagSmoother.h | ||
| BayesTreeMarginalizationHelper.h | ||
| CMakeLists.txt | ||
| ConcurrentBatchFilter.cpp | ||
| ConcurrentBatchFilter.h | ||
| ConcurrentBatchSmoother.cpp | ||
| ConcurrentBatchSmoother.h | ||
| ConcurrentFilteringAndSmoothing.cpp | ||
| ConcurrentFilteringAndSmoothing.h | ||
| ConcurrentIncrementalFilter.cpp | ||
| ConcurrentIncrementalFilter.h | ||
| ConcurrentIncrementalSmoother.cpp | ||
| ConcurrentIncrementalSmoother.h | ||
| FixedLagSmoother.h | ||
| IncrementalFixedLagSmoother.cpp | ||
| IncrementalFixedLagSmoother.h | ||
| LinearizedFactor.cpp | ||
| LinearizedFactor.h | ||
| NonlinearClusterTree.h | ||