/**
 * floyd 算法
 * 多源最短路径
 * @filename: packages/utils/src/data-structure/Graph/floyd.ts
 * @author: Mr Prince
 * @date: 2022-10-19 17:34:35
 */
/**
 * 对于其中未连通的节点，需填充一个极大值
 *
 * @public
 *
 * @param adjacent 邻接矩阵 adjacent.length == adjacent[0].length
 */
declare const floyd: (adjacent: number[][]) => void;
export default floyd;