搜索资源列表
Dijkstra
- C++实现贪心算法 Dijkstra 单源最短路径-C++ greedy algorithm of Dijkstra single source shortest path
dijkstra
- dijkstra是MATLAB里面比较常用的一种算法，应该有用-if it can help,go ahead
DijkstraCsharp
- Dijkstra算法求最短路径(C#版) 采用C#语言编写，并附有车辆模型例题,方便大家的学习- Dijkstra shortest path algorithm (C# version) using the C# language, along with a vehicle model examples, we facilitate learning
Dalgo
- 给一个图，用Dijkstra算法寻找最短路径-Finding the shortest path in a graph using Dijkstra Algorithm
ShortPath
- 单源点最短路的Dijkstra算法，实现了界面以及动态演示过程，运行通过，精心编写，对于理解数据结构等非常有用，绝对独创。-Dijkstra shortPath
Dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm for computing the shortest path one node to all other node
olsrd-0.6.4.1.tar
- LSR是一种表驱动的路由协议,它在全网范围内周期性地交换网络拓扑更新和链路状态信息,努力使每个节点都掌握到最新的全网拓扑图,当有业务到来,需要寻找路由时,节点根据自己拥有的拓扑图,在内部运行基于图论的Dijkstra算法,获得去往目的节点的路由.-Multi-Smart-Gateway mode: a new feature which- together with BRDP (Border Router Discovery Proto
16mesh_net_10wave_simple
- 这是基于VC的16节点格型光网络的方针程序，假设每条信道有10个波长，随机产生业务请求。具体看程序，探讨请私信。路由采用Dijkstra算法，一个小例子。-this is a simulation for 16 nodes-optical net based on VC6.0.
graph
- 提供堆优化的Dijkstra算法、求割点割边的Tarjan算法-Heap optimized Dijkstra algorithm, for cutting point cutting edge Tarjan algorithm
Graph-algorithm-and-Matlab-program
- 求单源最短路径的Dijkstra算法的Matlab程序 求Euler回路的Fleury算法的Matlab程序 求最小生成树的Prim算法的Matlab程序 求Huffman树的Matlab程序 最大流算法Matlab程序 求任意两点间最短路的Floyd算法的Matlab程序 -Seeking single-source shortest path Dijkstra algorithm Matlab program
dijkstra
- 如果存在一条从i到j的最短路径(Vi.....Vk,Vj)，Vk是Vj前面的一顶点。那么(Vi...Vk)也必定是从i到k的最短路径。为了求出最短路径，Dijkstra就提出了以最短路径长度递增，逐次生成最短路径的算法-Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the sh
ShortestPath
- 单源最短路径算法，dijkstra算法的实现 给定一些路口和道路，用有向图实现组织这些数据，然后用dijkstra算法找到单源到其他地方的最短路径-As residents of Chicago land, most of us face the realities of heavy traffic. If we attempt to drive on a local freeway during rush hour, we in
Dijkstra
- 旅行商问题的一个变形，主要采用迪杰斯特拉算法来进行求解，，问题详情请见文件中图片内容，可以当做练手用-A variant of the traveling salesman problem, mainly Dijkstra algorithm to solve the problem ,, details see file picture content, as practiced hand
Dijkstra
- 计算从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。-Computing the shortest path one vertex to the rest of the vertices , the solution is to map the shortest path problem.
Dijkstra
- C语言实现Dijkstra最短路径算法，按要求输出邻接矩阵，并显示源点到目的地所经过的所以节点和总距离。-Dijkstra shortest path algprithm
Graph
- 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved
dijkstra_pro
- Dijkstra算法，求最短路径，带有路径的权值-Dijkstra method, solve the shortest path, including the weight of path
Kruskal.cpp
- 基于c语言的克鲁斯卡尔算法和Dijkstra算法-Kruskal arithmetic and Dijkstra arithmetic with C
zuiduanlu
- 两种实用性非常强的最短路算法，一个是dijkstra算法，还有一个是比较新的spfa算法，全都自带输出格式，推广性很强。-Two kinds of practical, very strong shortest path algorithm, one is dijkstra algorithm, there is a relatively new spfa algorithm, all carrying the output forma
Dijkstra
- dijkatra算法的应用，可以在数学建模里使用-application of dijkatra