搜索资源列表
floyd
- 求最短路径的最短距离！功能强大···不容置疑-The shortest path for the shortest distance! No doubt a powerful
Dijkstra
- 最短路径算法 C语言版的 很好用 需要的试试吧-Shortest path algorithm C language version of the well with
network
- 用神经网络的方法计算最短路径，用例子的方式计算出了五个城市间的最短距离。-Neural network with the shortest path method
OSPF
- OSPF- Open shortest path first. which a routing protocol. uses IP version 4-OSPF- Open shortest path first. which a routing protocol. uses IP version 4
Dijkstra_exe
- Dijkstra by C is so great for solving algorithm find the shortest path with weigth!
bfs-src
- 1.程序基于java语言。运行要求java运行环境。即就使jdk1.2以上。否则程序无法运行。 2.程序中读图时，可以选择读有向图还是无向图。 3.本程序为一个图的综合运行环境。提供了图的各种操作。包括读图，DFS判断图中是否存在 环路，BFS全局访问，两点之间的最短路径，屏幕清空。并且跟踪说明了图的各种操作的 过程。 4.程序可以多次的读图，进行图的各种操作。点击面板上的各种按钮就可以进行各种操作。-1. Procedures based on the java language.
shortestpath
- 最短路径算法，超级经典的，欢迎大家下载，谢谢啊！-Shortest path algorithm, super-classic, welcome to download
tanxin
- 算法设计与分析中贪心算法C++实现代码 包括但愿最短路径问题，哈弗曼编码，整数最有分解，最小生成树，最优分解，删数问题等-Algorithm Design and Analysis of greedy algorithm in C++ code, including the realization of hope that the shortest path problem,哈弗曼coding, the most integral decomposition, minimum spanning
graph
- 图的遍历，能够快速找到图中的最短路径，复杂度低-Graph traversal, can quickly find the shortest path map, low complexity
dongtaiguihua
- 该程序实现了动态规划问题，这样来求最短路径 绝对原创-The program achieved a dynamic programming problem, so that the shortest path to seeking absolute originality I would like to thank
S030602102
- 赋权有向图中心问题 问题描述: 设G=(V,E)是一个赋权有向图，v是G的一个顶点， v的偏心距定义为： Max {w∈ V,从w到v的最短路径长度} G中偏心距最小的顶点称为G的中心。试利用Floyd 算法设计一个求赋权有向图中心的算法。-Empowering the central issue Digraph Problem Descr iption: Let G = (V, E) is a directed graph Empoweri
zuiduanlujingwenti
- 最短路径问题的PPT描述，在数学建模上的广泛应用-PPT shortest path problem described in the mathematical modeling on a wide range of applications
shortpaths
- Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest path from s to every other vertex-Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source verte
Floyd
- 实现Floyd算法，并求所示有向图中各顶点之间的最短路径及其长度。-Floyd algorithm to achieve, and for directed graph shown in between the vertex and the length of the shortest path.
Dijkstra
- 经典的dijkstra求最短路径算法，采用VC++编写-The dijkstra for the classic shortest path algorithm, using VC++ to prepare
107215765OPNET-AdHoc
- adhoc in c & c++ it hepls finding the shortest path among adhoc network . it provides advance protocols to find distence vector
shortpath
- 用c++实现求出最短路径的算法，并在结果中将其输出-Using c++ to achieve the shortest path algorithm to derive, and the result will be the output
2222
- ( 从太原市公交查询系统建立的必要性出发, 进行了公交查询算法的研究, 主要探讨了包括最短路径查 询及最少花费查询及数据库管理的公交查询系统的实现。 该系统采用了V ISU AL BA S IC 610 为开发工具, M ICRO SO FT A CCESS2003 为后台数据库, 开发了基于太原市公交线路的公交查询系统。具有线路查询、换乘 查询、 站点查询、 数据管理等一系列功能。 -(From the city bus system the need for inquiry
Floyd_Mini_Path
- 弗洛伊德算法求最短路径，适用于网络优化算法等应用-Freud for the shortest path algorithm for applications such as network optimization algorithms
zdlj
- 最短路径问题（包括Floyd算法和避圈法）的matlab程序，较实用-Shortest path problems (including Floyd algorithm and avoid the circle method) matlab procedures, more practical