From 259299ecae70194ff1d9b0558448efb3eb6ef494 Mon Sep 17 00:00:00 2001
From: Chris Dyer <cdyer@cs.cmu.edu>
Date: Mon, 2 Apr 2012 23:49:30 -0400
Subject: make sure i don't break build by adding RST parser stubs

---
 rst_parser/arc_factored.cc | 31 +++++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 rst_parser/arc_factored.cc

(limited to 'rst_parser/arc_factored.cc')

diff --git a/rst_parser/arc_factored.cc b/rst_parser/arc_factored.cc
new file mode 100644
index 00000000..1e75600b
--- /dev/null
+++ b/rst_parser/arc_factored.cc
@@ -0,0 +1,31 @@
+#include "arc_factored.h"
+
+#include <set>
+
+#include <boost/pending/disjoint_sets.hpp>
+
+using namespace std;
+using namespace boost;
+
+// based on Trajan 1977
+void ArcFactoredForest::MaximumSpanningTree(SpanningTree* st) const {
+  typedef disjoint_sets_with_storage<identity_property_map, identity_property_map,
+      find_with_full_path_compression> DisjointSet;
+  DisjointSet strongly(num_words_ + 1);
+  DisjointSet weakly(num_words_ + 1);
+  set<unsigned> roots, h, rset;
+  vector<pair<short, short> > enter(num_words_ + 1);
+  for (unsigned i = 0; i <= num_words_; ++i) {
+    strongly.make_set(i);
+    weakly.make_set(i);
+    roots.insert(i);
+  }
+  while(!roots.empty()) {
+    set<unsigned>::iterator it = roots.begin();
+    const unsigned k = *it;
+    roots.erase(it);
+    cerr << "k=" << k << endl;
+    pair<short,short> ij; // TODO = Max(k);
+  }
+}
+
-- 
cgit v1.2.3