mosesdecoder/moses/FloydWarshall.h

#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
Use portable include guard instead of pragma once git-svn-id: https://mosesdecoder.svn.sourceforge.net/svnroot/mosesdecoder/trunk@2939 1f5c12ca-751b-0410-a591-d2e778427230 2010-02-24 14:15:44 +03:00			`#ifndef moses_FloydWarshall_h`
			`#define moses_FloydWarshall_h`
move cube pruning moses lib to trunk git-svn-id: https://mosesdecoder.svn.sourceforge.net/svnroot/mosesdecoder/trunk@1848 1f5c12ca-751b-0410-a591-d2e778427230 2008-06-11 14:52:57 +04:00
			`#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);`

Use portable include guard instead of pragma once git-svn-id: https://mosesdecoder.svn.sourceforge.net/svnroot/mosesdecoder/trunk@2939 1f5c12ca-751b-0410-a591-d2e778427230 2010-02-24 14:15:44 +03:00			`#endif`