Source file for the MFAS class. More...
#include <gtsam/sfm/MFAS.h>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <unordered_set>
Go to the source code of this file.
Classes | |
struct | GraphNode |
Functions | |
double | absWeightOfEdge (const Key key1, const Key key2, const map< MFAS::KeyPair, double > &edgeWeights) |
unordered_map< Key, GraphNode > | graphFromEdges (const map< MFAS::KeyPair, double > &edgeWeights) |
void | removeNodeFromGraph (const Key node, const map< MFAS::KeyPair, double > edgeWeights, unordered_map< Key, GraphNode > &graph) |
Key | selectNextNodeInOrdering (const unordered_map< Key, GraphNode > &graph) |
double absWeightOfEdge | ( | const Key | key1, |
const Key | key2, | ||
const map< MFAS::KeyPair, double > & | edgeWeights | ||
) |
unordered_map<Key, GraphNode> graphFromEdges | ( | const map< MFAS::KeyPair, double > & | edgeWeights | ) |
void removeNodeFromGraph | ( | const Key | node, |
const map< MFAS::KeyPair, double > | edgeWeights, | ||
unordered_map< Key, GraphNode > & | graph | ||
) |