Description: 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtained arbitrary nodes all the shortest paths and shortest path graph of the function. This is a peer-to-peer (S-T) Dijkstra algorithm improvements. Seeking 2:00 for all the shortest path. Platform: |
Size: 3133 |
Author:阎一 |
Hits:
Description: 具有图形化界面的一个路由模拟程序。路由算法为Dijkstra算法。具有求出图中任意节点间所有最短路径以及最短路径子图的功能。这是一个点对点(S-T)Dijkstra算法的改进。用于求两点间的所有最短路径。-graphical interface with the simulation of a routing procedures. Routing algorithm Dijkstra algorithm. With map obtained arbitrary nodes all the shortest paths and shortest path graph of the function. This is a peer-to-peer (S-T) Dijkstra algorithm improvements. Seeking 2:00 for all the shortest path. Platform: |
Size: 3072 |
Author:阎一 |
Hits:
Search - pointtopointDijkstraAlgrithms