gtsam
Loading...
Searching...
No Matches
kruskal.h
Go to the documentation of this file.
1/* ----------------------------------------------------------------------------
2
3 * GTSAM Copyright 2010-2019, Georgia Tech Research Corporation,
4 * Atlanta, Georgia 30332-0415
5 * All Rights Reserved
6 * Authors: Frank Dellaert, et al. (see THANKS for the full author list)
7
8 * See LICENSE for the license information
9
10 * -------------------------------------------------------------------------- */
11
19
20#pragma once
21
22#include <gtsam/base/FastMap.h>
23#include <gtsam/inference/FactorGraph.h>
24
25#include <vector>
26
27namespace gtsam::utils {
36template <class FACTOR>
37std::vector<size_t> kruskal(const FactorGraph<FACTOR> &fg,
38 const std::vector<double> &weights);
39} // namespace gtsam::utils
40
41#include <gtsam/inference/kruskal-inl.h>
FastMap.h
A thin wrapper around std::map that uses boost's fast_pool_allocator.
FactorGraph.h
Factor Graph Base Class.
gtsam::utils::kruskal
std::vector< size_t > kruskal(const FactorGraph< FACTOR > &fg, const std::vector< double > &weights)
Compute the minimum spanning tree (MST) using Kruskal's algorithm.
Definition kruskal-inl.h:55