根据一个有权的无向图生成指定结点（路由器）的路由表设有结点N，N的路由表由若干个路由项组成，路由项是<目的结点，下一跳>的二元组，其中目的结点是以N结点为源结点，通过N结点可以直接到达（目的结点是N结点的邻居）或通过N结点的邻居可间接到达的结点，其中下一跳即N结点的某领居，通过该邻居可间接到达目的结点，且到达目的结点的路径为最小代价路径.-According to a right of the undirected graph to generate the specified node (router) routing table with nodes N, N' s routing table routing by a number of components, routing is < the purpose of nodes, next hop>　dual group node is one of the purpose of node N as the source node by node N can arrive (the purpose of node N are neighbor nodes) or through a neighbor node N can be indirectly Get the nodes, that is one of the next hop of a node N from home, the adoption of the neighbor may be an indirect purpose of node arrival and arrival at the destination node for the smallest cost of the path path.