dijkstra.h
来自「it is very important」· C头文件 代码 · 共 15 行
H
15 行
// Define the prototype for the Dijkstra SPF algorithm// George F. Riley, Georgia Tech, Winter 2000#ifndef __DIJKSTRA_H__#define __DIJKSTRA_H__#include "rnode.h"// The prototype for the shortest path functionvoid Dijkstra(RNodeVec_t& N, // List of nodes in the graph nodeid_t root, // Root node for route computations RoutingVec_t& NextHop, // Returned "FirstHop" vector RoutingVec_t& Parent); // Returned "Parent" vector#endif
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?