搜索资源列表
最短距离问题
- 求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest pat
最短路径的求解
- 本实验中的问题是一个逻辑问题，而实验的目的是运用邻接矩阵解决图存储并解决在此结构情况下对矩阵中元素的扫描计算。其关键是怎样储存和计算。储存用的是邻接矩阵，而计算是用迪杰斯特拉算法。-experiment of the problem is a problem of logic, and The purpose of this experiment is to use the adjacency matrix storage solutions and plans to solve the st
TravelGuideApp
- 最短路径和哈密顿通路，可以求得多条最短路径和哈密顿通路。-shortest path Hamiltonian path and can be obtained over the shortest path and Hamiltonian path.
Win32Maze
- Win32下立体迷宫程序，含自动求解，可求迷宫最短路径和所有路径，分别用广度优先搜索和深度优先搜索两种方法实现，欢迎讨论。-Win32 three-dimensional maze procedure, including automatic solution Stepping maze shortest path and all trails. priorities were used to search breadth and depth-first search in two ways,
dijkstraCPP
- 由graph.txt读出源图并用临街链表显示出，然个用dijkstra算法算出给定两点的最短路径和任一给定点到其它各点的距离，graph.txt放在源代码同一目录，内附graph.txt示例-graph.txt read out by the source map and used chain along the street shows, However use the dijkstra algorithm to calculate the scheduled 2:00 and the sho
Dijkstra_TA
- 数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统；输入为出发城市和目标城市, 输出为最短路径和距离。 -data structure of the classic experimental procedure. In major cities across the country to the vertex, the railway linking the edge of the map, as the weighted
58
- 求解最优交通路径，程序预置部分城市间距离，由用户选择两个城市，计算出两城市间最短路径和相应路线。
向加权图的建立、显示和寻找最短路径
- 有向加权图的建立、显示和寻找最短路径, Has to the weighting chart establishment, demonstrated and seeks the most short-path
tsp.rar
- 旅行商问题，总共30个城市，计算最优路线和最短路径,Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
MapGuide.rar
- 超强寻找最短路径和全部结点遍历。用了GDI显示。,Super find the shortest path and all nodes traversal.
Dijkstra
- 用弗洛伊德算法和狄克斯特拉算法实现求最短路径-Algorithm and狄克斯特拉with Freud for the shortest path algorithm
floyd
- floyd算最短路径，函数和例子都有。只需要把数据转换就行-floyd
basicoperationformap
- 包括了图的大部分基本算法，每一种算法都以邻接矩阵与邻接表两种形式给出，算法包括建图，图的遍历（如DFS和BFS），最小生成树，从某个源点到蓁各顶点的最短路径等-Includes most of the basic graph algorithms, each algorithm is to adjacency matrix and adjacency list is given in two forms, algorithms, including the construction of map
shortestpath
- 最短路径算法，内含5个m文件首先在m脚本文件canshuo.m中输入节点个数和路径权重-The shortest path algorithm, containing 5 m file first in the m scr ipt file canshuo.m in the number of input nodes and path weights
BestPath
- 主要实现最短路径的可视化展示。可以在程序中利用鼠标绘制路网，自定义起点和终点后就能自动的绘制出最短路线。-To achieve the shortest path to the main visualization display. Can be used in the program draw the road network in the mouse, custom start and finishing point will be able to automatically draw th
park
- 是公园路径搜索的c++实现方法，功能比较简单，是课程设计的。用到了迪杰斯特拉算法和贪心算法求最短路径-Is a park path search c++ implementation method is relatively simple functions, curriculum design. Use the Dijkstra algorithm and the greedy algorithm for the shortest path
Asuanfa
- 建立一个30*30带障碍的小地图，包括起点和终点。寻找最短路径。(Create a small map of 30*30 with obstacles, including starting and ending points. Find the shortest path.)
FLOYD
- 用MATLAB实现最短路径问题，F算法和D算法，已调通(Using MATLAB to achieve the shortest path problem, D algorithm, has been tuned)
图的最短路径之迪杰斯特拉和弗洛伊德算法
- 数据解构中的经典算法，图的最短路径算法之迪杰斯特拉和弗洛伊德的C++实现(Classic algorithms in data deconstruction, Dijkstra's and Floyd's C++ implementation of the shortest path algorithm of graphs)
matlab计算最短路径
- 在Matlab软件中，用Dijkstra算法和Floyd算法计算出最短路径。