/**
 * Dijkstra 最短路径算法
 * @filename packages/utils/src/data-structure/Graph/dijkstra.ts
 * @author Mr Prince
 * @date 2023-04-19 11:23:31
 */
/**
 * 求起始点到其他所有点的最短距离
 *
 * @param adjacent 邻接矩阵 adjacent[i][j]: 从 i 到 j 的距离为 adjacent[i][j]
 * @param start 起始点
 */
declare const dijkstra: (adjacent: number[][], start: number) => number[];
export default dijkstra;