bfs.h

来自「it is very important」· C头文件 代码 · 共 14 行

// Breadth first search routing algorithm
// George F. Riley, Georgia Tech, Winter 2000

#ifndef __BFS_H__
#define __BFS_H__
#include "rnode.h"

// The prototype for the shortest path function
void BFS(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