搜索资源列表
-
1下载：
具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtained arbitrary nodes all the sh
-
-
0下载：
最短路径
----因特网最短路径优先(OSPF)路由算法的实现
----- Internet shortest path shortest path first (OSPF) routing algorithm to achieve
-
-
0下载：
计算图中两点间的最短路径,采用邻接链表存储结构.-Calculation chart the shortest path between two points using adjacent storage structure list.
-
-
0下载：
VC游戏编写中的求解最短路径算法源码，本示例是自动寻径演示，篮点是起点，红点是终点，按确定键开始。源码爱好者注：编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中，若不然会出错-VC games in preparation for solving the shortest path algorithm source code, this example is the automatic routing demonstration of basket is that starti
-
-
0下载：
复杂网络中最短K条路径问题的求解算法研究.pdf 求解路径问题的另一新颖的算法-Complex network of K shortest path algorithm to solve the problem. Pdf Routing Problem Solving another novel algorithm
-
-
0下载：
The task in this assignment is to implement an airline routing system. Your
system should be able to read in a
ight network as a graph from a le, where
airports are represented as vertices and
ights between airports are represented
as ed
-
-
0下载：
Dijkstra算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-Dijkstra' s shortest path algorithm is a typical routing algorithm used to calculate a node to all other nodes in the shortest path.
-
-
0下载：
最短路由算法用c++编写的程序能解决路由从一点到令一点的最短路径-Shortest routing algorithm using c++ programs written to solve the routing from point to point shortest path that
-
-
0下载：
分支限界法之布线问题 一、要求：
1、输入电路板区域n*m以及布线的起始位置和结束位置；
2、输出布线方案；
3、可以使用c或者vc实现
二、问题分析及实验原理：
在n*m的方格阵列中存在封锁区域（布线时必须绕开的区域），找到起始位置到目标位置的最短路径。从目标位置开始向起始位置回溯，逐步构造最优解。每次向标记距离比当前方格标记距离少1的相邻方格移动，直到到达起始方格为止。-Branch and bound method of a wiring
-
-
0下载：
路由算法，对图进行最短路径选择，只需更改最大结点个数，邻接矩阵即可使用。-Routing algorithm, the shortest path to the graph selection, simply change the maximum number of nodes, the adjacency matrix can be used.
-
-
0下载：
用C语言实现最短路径算法 最小生成树 本程序是用F算法求最短的路由花费 可计算的最大的路由结点数为100 */
/* 运行环境： vc++6.0 */
-C language with the shortest path algorithm minimum spanning tree algorithm of the program is seeking the shortest route F calculate the maximum cost of routing nodes 1
-
-
0下载：
这是一个求解k条最短路径路由的算法程序，已经调试通过。-This is a solution of the k shortest path routing algorithm, has been through debugging.
-
-
0下载：
因特网最短路径优先(OSPF)路由算法的实现：根据给定的网络拓扑图求某路由器到其它路由器的最短路径，并生成路由表-Internet Shortest Path First (OSPF) routing algorithm to achieve: given the network topology of a router to other routers find the shortest path, and generate routing tables
-
-
0下载：
Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径-Dijkstra (Dijkstra) algorithm is a typical shortest path routing algorithm used to calculate a node to all other nodes of the shortest path
-
-
0下载：
此代码实现了网络结点之中最短路径的计算，并输出了各个网络结点的路由表
，路由表包括：目的网络，下一跳，代价，详细地址。此代码的原理是Dijstra算法。在代码的注释中有测试用例,用户测试时只需将程序运行后再将测试用例复制到DOS黑框中即可。测试用例中有详细的用例解释。-This code implements the network nodes being the shortest path calculation, and output of each network node routi
-
-
0下载：
用C写的迷宫寻路算法，运行环境vc++6.0，能够寻找到从入口到出口的最短路径-Written in C maze routing algorithm, the environment vc++ 6.0, able to find the shortest path the inlet to the outlet
-
-
0下载：
dijstra算法 网络的节点之间的最短路径(Dijstra algorthm,computing the shortest path between network diagrams,applied to routing in computer network.)
-
