gtsam/cpp/graph-inl.h

/*
 * graph-inl.h
 * @brief Graph algorithm using boost library
 * @author: Kai Ni
 */

#pragma once

#include <boost/foreach.hpp>
#include <boost/graph/breadth_first_search.hpp>

#include "graph.h"

using namespace std;

#define FOREACH_PAIR( KEY, VAL, COL) BOOST_FOREACH (boost::tie(KEY,VAL),COL)

namespace gtsam {

// some typedefs we need

//typedef boost::graph_traits<SDGraph>::vertex_iterator BoostVertexIterator;

//typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS,
//		boost::property<boost::vertex_name_t, std::string> > SGraph;
//typedef boost::graph_traits<SGraph>::vertex_descriptor SVertex;


/* ************************************************************************* */
template<class G, class F, class Key>
SDGraph<Key> toBoostGraph(const G& graph) {
	// convert the factor graph to boost graph
	SDGraph<Key> g(0);
	typedef typename boost::graph_traits<SDGraph<Key> >::vertex_descriptor BoostVertex;
	map<Key, BoostVertex> key2vertex;
	BoostVertex v1, v2;
	BOOST_FOREACH(F factor, graph) {
		if (factor->keys().size() > 2)
			throw(invalid_argument("toBoostGraph: only support factors with at most two keys"));

		if (factor->keys().size() == 1)
			continue;

		Key key1 = factor->key1();
		Key key2 = factor->key2();

		if (key2vertex.find(key1) == key2vertex.end()) {
				 v1 = add_vertex(key1, g);
				 key2vertex.insert(make_pair(key1, v1));
			 } else
				 v1 = key2vertex[key1];

		if (key2vertex.find(key2) == key2vertex.end()) {
			 v2 = add_vertex(key2, g);
			 key2vertex.insert(make_pair(key2, v2));
		 } else
			 v2 = key2vertex[key2];

		boost::property<boost::edge_weight_t, double> edge_property(1.0);  // assume constant edge weight here
		boost::add_edge(v1, v2, edge_property, g);
	}

	return g;
}

/* ************************************************************************* */
template<class G, class V, class Key>
boost::tuple<G, V, map<Key, V> > predecessorMap2Graph(const PredecessorMap<Key>& p_map) {

	G g(0);
	map<Key, V> key2vertex;
	V v1, v2, root;
	Key child, parent;
	bool foundRoot = false;
	FOREACH_PAIR(child, parent, p_map) {
		if (key2vertex.find(child) == key2vertex.end()) {
			 v1 = add_vertex(child, g);
			 key2vertex.insert(make_pair(child, v1));
		 } else
			 v1 = key2vertex[child];

		if (key2vertex.find(parent) == key2vertex.end()) {
			 v2 = add_vertex(parent, g);
			 key2vertex.insert(make_pair(parent, v2));
		 } else
			 v2 = key2vertex[parent];

		if (child==parent) {
			root = v1;
			foundRoot = true;
		} else
			boost::add_edge(v2, v1, g); // edge is from parent to child
	}

	if (!foundRoot)
		throw invalid_argument("predecessorMap2Graph: invalid predecessor map!");

	return boost::tuple<G, V, map<Key, V> >(g, root, key2vertex);
}

/* ************************************************************************* */
template <class V,class Pose, class Config>
class compose_key_visitor : public boost::default_bfs_visitor {

private:
	boost::shared_ptr<Config> config_;

public:

	compose_key_visitor(boost::shared_ptr<Config> config_in) {config_ = config_in;}

	template <typename Edge, typename Graph> void tree_edge(Edge edge, const Graph& g) const {
		typename Config::Key key_from = boost::get(boost::vertex_name, g, boost::source(edge, g));
		typename Config::Key key_to = boost::get(boost::vertex_name, g, boost::target(edge, g));
		Pose relativePose = boost::get(boost::edge_weight, g, edge);
		config_->insert(key_to, compose(relativePose, (*config_)[key_from]));
	}

};

/* ************************************************************************* */
template<class G, class Factor, class Pose, class Config>
boost::shared_ptr<Config> composePoses(const G& graph, const PredecessorMap<typename Config::Key>& tree,
		const Pose& rootPose) {

	//TODO: change edge_weight_t to edge_pose_t
	typedef typename boost::adjacency_list<
		boost::vecS, boost::vecS, boost::directedS,
		boost::property<boost::vertex_name_t, typename Config::Key>,
		boost::property<boost::edge_weight_t, Pose> > PoseGraph;
	typedef typename boost::graph_traits<PoseGraph>::vertex_descriptor PoseVertex;
	typedef typename boost::graph_traits<PoseGraph>::edge_descriptor PoseEdge;

	PoseGraph g;
	PoseVertex root;
	map<typename Config::Key, PoseVertex> key2vertex;
	boost::tie(g, root, key2vertex) =
			predecessorMap2Graph<PoseGraph, PoseVertex, typename Config::Key>(tree);

	// attach the relative poses to the edges
	PoseEdge edge1, edge2;
	bool found1, found2;
	BOOST_FOREACH(typename G::sharedFactor nl_factor, graph) {

		if (nl_factor->keys().size() > 2)
			throw invalid_argument("composePoses: only support factors with at most two keys");

		// e.g. in pose2graph, nonlinear factor needs to be converted to pose2factor
		boost::shared_ptr<Factor> factor = boost::dynamic_pointer_cast<Factor>(nl_factor);
		if (!factor) continue;

		typename Config::Key key1 = factor->key1();
		typename Config::Key key2 = factor->key2();

		PoseVertex v_from = key2vertex.find(key1)->second;
		PoseVertex v_to = key2vertex.find(key2)->second;

		Pose measured = factor->measured();
		tie(edge1, found1) = boost::edge(v_from, v_to, g);
		tie(edge2, found2) = boost::edge(v_to, v_from, g);
		if (found1 && found2) throw invalid_argument ("composePoses: invalid spanning tree");
		if (!found1 && !found2) continue;
		if (found1)
			boost::put(boost::edge_weight, g, edge1, measured);
		else if (found2)
			boost::put(boost::edge_weight, g, edge2, inverse(measured));
	}

	// compose poses
	boost::shared_ptr<Config> config(new Config);
	typename Config::Key rootKey = boost::get(boost::vertex_name, g, root);
	config->insert(rootKey, rootPose);
	compose_key_visitor<PoseVertex, Pose, Config> vis(config);
	boost::breadth_first_search(g, root, boost::visitor(vis));

	return config;
}

/* ************************************************************************* */

}