搜索资源列表
Visit-system
- 实现功能：1,从文件读入景点信息道路信息，然后用邻接表建立校园图，用邻接矩阵存放边的信息。 2,查看景点信息，道路信息。 3,查找两点之间最短路径，采用弗洛依德算法。 4,采用深度优先递归调用的方法遍利图。-Functions: 1, read from the file into the attractions road information and the establishment of the campus map, and then use the adjacency l
graph
- 这个源代码包含了图的邻接矩阵和链表的两种存储方式、深度和广度的遍历以及prim 和kruskal最短路径两种算法。-The source code contains the adjacency matrix and list two storage mode, the breadth and depth of the traversal and prim And kruskal shortest path of two algorithms.
Dijkstra
- 最短路径Dijkstra算法,,还有实验报告-The shortest path Dijkstra algorithm, as well as experimental reports
query-system
- 对武汉大学信息学部的最短路径查询算法，位置查询，与数据连接查询-Wuhan University Division of the shortest path query algorithm, location query, the query data connection
Data_Structer
- 一个寻找最短路径的算法，别人提出细想，自己用C语言实现，希望能帮上忙-Finding the shortest path algorithm, another to reflect on their own using the C language, and hope I could help
shortestpath
- 用可达矩阵算法实现最短路径,并求出path路径，以及可知道图中是否带环等功能-shortest path
Data-structure
- C#图形界面数据结构课程设计，含最小生成树，最短路径，工程图算法-C# graphical interface data structures course design, including the minimum spanning tree, shortest path, drawing algorithm
Dijkstra
- 本代码应用Dijkstra算法，实现了找最短路径问题，仿真了整个过程，是一个高效实用的代码值得下载实用。-This code apply Dijkstra algorithm to find the shortest path problem, the simulation of the whole process is a practical and efficient code is worth the download utility.
SearchReplaceStr
- 本代码应用Dijkstra算法，实现了找最短路径问题，仿真了整个过程，是一个高效实用的代码值得下载实用。很不错-This code apply Dijkstra algorithm to find the shortest path problem, the simulation of the whole process is a practical and efficient code is worth the download utility. Very good
ToBinary
- 本代码应用Dijkstra算法，实现了找最短路径问题，仿真了整个过程，是一个高效实用的代码值得下载实用。很不错-This code apply Dijkstra algorithm to find the shortest path problem, the simulation of the whole process is a practical and efficient code is worth the download utility. Very good
shagnji
- 该程序用c++语言实现了算法设计学习中经典的0-1问题、旅行者最短路径问题。-The program c++ language to achieve a classic 0-1 in the algorithm design learning Traveler shortest path problem.
floyd
- 动态规划的算法，求解所有的路径之间的最短路径，时间复杂度在O(n3)-Dynamic programming algorithm for solving the shortest path between all paths, the time complexity of O (n3)
kruskal
- kruskal的一个通用算法的例程，非常有利于最短路径相关的学习-kruskal the routine of a generic algorithm, is very conducive to the learning of the shortest path
3
- 对所给出的城市路口、道路信息，分别用Dijkstra 算法和Floyd算法，求出两两之间的最短距离和路径，结果输出到文件，每行一组最短路径，其格式为逗号分割的信息，分别为起点、终点、最短距离、中间依次经过的路口编号，各行按照起点编号、终点编号从小到大排序，只输出起点编号小于终点编号的部分。 -Information given city intersection, road, Dijkstra algorithm and Floyd algorithm to calculate the sh
Msearchha
- 迷宫搜索 ，A*算法 ，自动生成成迷宫矩阵，查找最短路径可直接使用。 -Maze search, A* algorithm, and automatically generated into a maze matrix, find the shortest path can be used directly.
T7_42zipo
- 以邻接表为存储结构实现求从源点到其余各顶点的最短路径的Diijkstra算法-Dijkstra，已通过测试。 -Adjacency list, ask the rest of the vertices of the shortest path from source to the storage structure Diijkstra algorithm-Dijkstra, has been tested.
bellman-ford2
- 用bellman ford算法求最短路径，并且输出最短路径的节点，输入有语言提示-Bellman ford algorithm for the shortest path and the output node of the shortest path, enter the language prompts
Map
- 对图的各种操作，包括深度遍历，广度遍历，最小生成树，最短路径的各中算法，而且有递归和非递归方式，对学习数据结构有很大的帮助。 代码全是自己根据理解自己写的，思路很符合初学者。-Various operations on the map, including the traverse depth, breadth traversal, minimum spanning tree, shortest path in the algorithm, and recursive and non rec
floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-Floyd algorithm, also known as Freud algorithm, interpolation point method, is a given weighted graph to find the shortest path algorithm vertices.
vb
- 公交车作为现代城市生活中一种重要的交通工具，在现代城市生活中尤其重要，公交线路繁多，数量也逐渐增多，这样使得人们的出行很不方便。在这样的背景下，我们决定做公交查询系统，并以六安市公交数据为例,设计了公交查询系统,验证了一些算法的可行性。该算法基于对经典的算法的学习和研究,沿用其关于求最短路径的思想,并加以对换乘次数，站点范围限制等内容的深入研究而提出的。-Bus as an important means of transportation in modern urban life in mod