Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorHieu Hoang <hieuhoang@gmail.com>2012-11-12 23:56:18 +0400
committerHieu Hoang <hieuhoang@gmail.com>2012-11-12 23:56:18 +0400
commit5e3ef23cef6101d2c098eb3445f562e8f595655b (patch)
treeb8c332b6fa82bae84ea4910967a10ba1b08a7107 /moses/FloydWarshall.h
parent8c785cff2b1be3cccd76ea9026f71b649762dfc3 (diff)
move moses/src/* to moses/
Diffstat (limited to 'moses/FloydWarshall.h')
-rw-r--r--moses/FloydWarshall.h12
1 files changed, 12 insertions, 0 deletions
diff --git a/moses/FloydWarshall.h b/moses/FloydWarshall.h
new file mode 100644
index 000000000..96845caf6
--- /dev/null
+++ b/moses/FloydWarshall.h
@@ -0,0 +1,12 @@
+#ifndef moses_FloydWarshall_h
+#define moses_FloydWarshall_h
+
+#include <vector>
+
+/**
+ * Floyd-Warshall all-pairs shortest path algorithm
+ * See CLR (1990). Introduction to Algorithms, p. 558-565
+ */
+void floyd_warshall(const std::vector<std::vector<bool> >& edges, std::vector<std::vector<int> >& distances);
+
+#endif