floydwarshall.h.svn-base

来自「moses开源的机器翻译系统」· SVN-BASE 代码 · 共 11 行

#pragma once

#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);