搜索资源列表
Floyd
- 采用了动态规划法即FLOYD算法利用矩阵求多源最短路径的JAVA实现-Using a dynamic programming method that is FLOYD algorithm uses matrix Multi-source shortest path to achieve JAVA
Noname1
- 用无向网表示你所在学校的校园景点平面图，图中定点表示主要景点，存放 景点的编号、名称、简介等信息。要求能够回答有关景点介绍、游览路经等问题。 要求：(1)查询各景点相关信息； (2)查询图中任意两个景点的最短路径。 (3)查询图中任意两个景点的所有路径。 --Free to the net means that the school campus attractions in your plans, the figure fixed-point of their main a
Map
- 基于Java的最短路径连通图 用于一般大学计算机专业数据结构课设-Java-based shortest-path connected graphs for general university computer science courses based data structure
LabeledIconWndDemo
- 使用VC++编写的城市间最短路径问题的演示程序，具有图形化界面，采用Dijkstra算法，能够生成任意两个城市间的路径长度和具体路径。-This project is programmed in VC++ to demonstrate a demo which solves shortest path problem between two cities。This program has a city network GUI, utilizes Dijkstra algorithm and c
simulated_annealing
- 人工智能问题，通过模拟退火算法实现旅行商问题，随机产生31个地址，计算旅行商走完的最短路径，并绘制路线图。作者：陈华昌-Using simulated annealing algorithm achive "traveler" problem.
Dijkstra
- 最短路径算法 很不错的哦 适合初学着学习-the shortest
tsp
- 用遗传算法解决最短路径优化TSP 问题（附matlab源程序.txt）-The solvelution of the shortest path optimization problem TSP by using genetic algorithms (matlab source. Txt)
suanfa
- 里面包含了各种常用算法的java实现，如八皇后问题，合唱队问题，找零钱问题，最短路径问题等-Which contains a variety of commonly used algorithm java implementation, such as the eight queens problem, chorus problems, to find small change problem, the shortest path problem, etc.
SchoolScenes_Guide
- 用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度信息等。 要求事先一下功能： （1） 查询各顶点的相关信息。 （2） 查询图中任意两个景点之间的最短路径。 （3） 查询图中任意两个景点之间的所有路径。 --Free to the net means that the school campus attractions in your plans, the graph vertices of
GATSP
- 遗传算法计算最短路径，从A城市出发到Z城市，一共76个城市参与计算-Genetic algorithm to calculate the shortest path from A to Z City departure city, a total of 76 cities involved in the calculation
AstarPath
- 经过改造与优化的A*算法， 求最短路径，能够标识出每一步寻找的结点。-After transformation and optimization of the A* algorithm, seeking the shortest path to identify each step of the search nodes.
Park
- 公园导游图 数据结构 本系统实现： 1.公园内任两景点之间最短路径的查询 2.输出公园景点分布 3.最佳路径（很多程序里面都没有这个，是本人熬夜将一C++程序改为C，并数据结构化。）-The system implementation: 1. Park, the shortest path between any two spots query 2. Output of the distribution of three park attractions. The best pa
God
- 用Windows控制台程序实现A*算法在交通网络中寻找最短路径的应用，并附有实际的测试数据，程序已经调过没有问题。-Windows Console Application with the realization of A* algorithm to find the shortest path transport network applications, along with the actual test data, the program has emphasized there is
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
Dijkstra
- OSPF仿真 自己做的一款仿真 能实现最短路径优先路由选择协议-a simulation of OSPF
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
zuiduanlujing
- 最短路径程序，非常完整，几乎所有的最短路径算法都包括了。。。绝对值得下载-The shortest path procedure, very complete, almost all of the shortest path algorithm is included. . . Definitely worth downloading
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
1
- 动态规划的基础题，详细讲解了利用动态规划求最短路径的问题-Dynamic Programming- Shortest path problem
shortestpath
- 求最短路径的好例子，日本人写的，鬼子还真是有一手-Good example for computing shortest path.