搜索资源列表
lab4
- 最短路径算法 可以设置路径的权值 可以打印每条路径的权值-shortest path algorithm
shortest-path
- 最短路径算法,对于权重图最短路径计算的基本算法-Shortest path algorithm, the basic algorithm for computing the shortest path weight of FIG.
4.2
- 基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法,路径必须经过要求的必经点,且不成环。 该算法采用了一种自适应调整的方法,经过多次迭代,使解收敛。 但只是寻找了一个略优的可行解(每次迭代都基于贪婪算法寻找),不能保证最优解。而且如果图过于稀疏,因为收敛速度过快,可能导致问题无解(收敛于一个局部最优解,没有经过所有点)。 解决相对稠密的图(每个点的平均出入度4以上),表现良好。 备注:里面有一个QT的工程,可以直接打开(源码里没用QT的库)-Weigh
submit
- 对有约束问题的最短路径算法,有必经节点,基于DFS和迪杰斯特拉算法-Problem of constrained shortest path algorithm, must pass through a node-based DFS and Dijkstra Algorithm
HuffmanTree-Shortest-Path
- 赫夫曼树的建造过程,以及最短路径算法,有关键步奏的注释,需输入节点数据以及邻接矩阵的内容,注意看主函数-Huffman tree construction process, as well as the shortest path algorithm, the key step-outs comments, data and content needs input node adjacency matrix, note the main function
Dijkstra
- Dijkstra算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。-Dijkstra algorithm
Dijkstra
- 数据结构Dijkstra迪杰斯特拉带权有向图求最短路径算法,有图分析。-Data structure Dijkstra Dijkstra weighted directed graph algorithm for the shortest path between a figure analysis.
WWZCM
- 编写的最短路径算法,娃娃找草莓,我改写了一下-Shortest path algorithm written doll find strawberries, complete demonstration program, study the game the shortest path or the data structures are useful.
Floyd
- Floyd算法的C++实现,求任意两点间最短路径 算法复杂度 O(n^3)-Floyd algorithm
dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止-Dijkstra (Dijkstra) algorithm is a typical single source shortest path algorithm for computing a node to all other nodes of the shortest path. The main feature is the sta
dijkatra.c
- dijstra算法 网络的节点之间的最短路径(Dijstra algorthm,computing the shortest path between network diagrams,applied to routing in computer network.)
min_dis_Dij
- min_dis_Dij.zip:利用Dijkstra算法求最短路(Use Dijkstra to solve the minimum distance problem)
floyd
- Floyd算法又称为弗洛伊德算法、插点法,是一种用于寻找给定的加权图中顶点间最短路径的算法。(Floyd algorithm, also known as plug-in method, is an algorithm for finding the shortest path between vertices in a given weighted graph.)
floyd
- 这个可以用于导弹发射问题,可以搜索出发射最短路径(you can select the best way)
作业7
- 一.问题描述 设计、实现一个全国大城市间的交通咨询程序,为旅客提供三种最优决策方案:(1)飞行时间最短(2)总用时最短(3)费用最小(4)中转次数最少。 二、实验要求 (1)选取合适的数据结构存储带权路线图 (2)实现单源最短路径算法(1. Descr iption of the problem To design and implement a transportation consultation process between the major cities, we prov
program 3
- 实现对美国地图的朴素迪杰斯特拉算法与A*最短路径搜索(Simple implementation of Dijkstra algorithm and A* on the map of the United States of the shortest path search)
dij
- 算法实现了迪杰斯特拉最短路径选择,较好的实现了算法(The algorithm implements the shortest path selection of Dijkstra)
Dijkstra求最短路径
- dijkstra suanfa dijkstra suanfa
1
- 济南大学校园导航,,查询最短路径,校园景点查询,有条件最短路查询(University of Jinan campus navigation, query shortest path, campus attractions inquiry, conditional shortest path query)
Dijstra算法
- Dijstra算法求无向图的最短路径,用10个结点的无向图为例,路径的起点可选择