almost fixed oredering except one function call

cpp/FactorGraph-inl.h

@@ -22,6 +22,7 @@
 #include <colamd/colamd.h>
 #include "Ordering.h"
 #include "FactorGraph.h"
+#include "graph-inl.h"
 
 // trick from some reading group
 #define FOREACH_PAIR( KEY, VAL, COL) BOOST_FOREACH (boost::tie(KEY,VAL),COL)

cpp/FactorGraph.h

@@ -17,7 +17,7 @@
 
 #include "Testable.h"
 #include "BayesNet.h"
-#include "graph-inl.h"
+#include "graph.h"
 
 namespace gtsam {
 

cpp/Ordering.cpp

@@ -30,13 +30,15 @@ public:
 	Ordering& ordering_;
 };
 
-/* ************************************************************************* *
-Ordering::Ordering(const map<string, string>& p_map) {
+/* ************************************************************************* */
+Ordering::Ordering(const PredecessorMap<string>& p_map) {
 
-	SGraph g;
+	typedef SGraph<string>::Vertex SVertex;
+
+	SGraph<string> g;
 	SVertex root;
 	map<string, SVertex> key2vertex;
-	boost::tie(g, root, key2vertex) = predecessorMap2Graph<SGraph, SVertex>(p_map);
+	//boost::tie(g, root, key2vertex) = predecessorMap2Graph<string>(p_map);
 
 	// breadth first visit on the graph
 	ordering_key_visitor vis(*this);

cpp/Ordering.h

@@ -10,6 +10,7 @@
 #include <string>
 #include <map>
 #include "Testable.h"
+#include "graph.h"
 
 namespace gtsam {
 
@@ -42,7 +43,7 @@ namespace gtsam {
 		/**
 		 * Generate the ordering from a spanning tree represented by its parent map
 		 */
-		//Ordering(const std::map<std::string, std::string>& p_map);
+		Ordering(const PredecessorMap<std::string>& p_map);
 
 		/**
 		 * Remove a set of keys from an ordering

cpp/graph.h

@@ -29,6 +29,7 @@ namespace gtsam {
 	template<class Key>
 	class SGraph : public boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS,
 			boost::property<boost::vertex_name_t, std::string> > {
+	public:
 		typedef typename boost::graph_traits<SDGraph<Key> >::vertex_descriptor Vertex;
 	};