搜索资源列表
mapx+vb+oracle实现的最短路径查询
- VB+mapinfo5开发的程序源代码,很不错,欢迎下载!-VB+ mapinfo5 development of the program's source code quite well, and welcome to download!
int dfsSweep
- 深度搜索算法,求解从起源点s到点j的最短路径算法的基本过程-depth search algorithm, solved from the point of origin j s close of the shortest path algorithm for the basic process
import java
- 比较牛的最短路径源代码。大家共享一下,呵呵。我的电子邮箱欢迎:Lyl@szzfcg.cn-the shortest path source code. Share what, huh. I welcome e-mail : Lyl@szzfcg.cn
蕊
- 学校景点分布图最佳路径选择,通过最短路径选择让游者能够自由选择最佳观赏路径-schools attractions distribution choose the best path through the shortest path chosen You can watch free to choose the best path
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of
求一个Dijkstra优化算法
- 求解一个最短路径问题程序,可以参考一下求一个Dijkstra优化算法! 谢谢了 目的是求给定两点之间的最短距离 或者改一下我的程序也行 -shortest path to solve a problem of procedure, can seek a reference Dijkstra algorithm optimization! Thank you, the purpose is scheduled for 2:
short_path
- 图遍历找两点最短路径的多中方法:贪心 回朔 分支界限-map traverse the shortest path to find two more of the methods : greed back Schomburg branch Limits
ayangmovie
- 有关遗传算法的例子,可以解决诸如数学中函数近似最大值,最短路径的问题.vb开发的,很好的 .-example, can be resolved, such as mathematics function approximate maximum shortest path problem. Vb development, very good.
id5
- 介绍动态规划方法在解决背包问题、图象压缩、矩阵乘法链、最短路径、无交叉子集和元件折叠等方面的应用。-on dynamic programming methods in solving knapsack problem, image compression, the matrix multiplication chains, the shortest path, non-overlapping subsets of folding and
北京交通大学校园旅游导航系统
- 北京交通大学校园旅游导航系统,利用Dijkstra算法在任意两点之间找到最短路径。-Beijing Jiaotong University Campus Tourism navigation systems, the use of arbitrary Dijkstra algorithm to find the shortest between the two paths.
dos下的校园导游图
- 校园导游图,在dos环境实现,用了最短路径算法,可以查询两点的最短路径及长度-campus tour map, dos environment achieved, with the shortest path algorithm can find the shortest path two lengths and
20046919413256
- 关于人工智能的最短路径,用flashMX制作. 算法简单,适合初学者-on the shortest path, using flashMX production. The algorithm is simple, suitable for beginners
maz
- 用c++实现迷宫程序,自动找到迷宫路径,且能找到最一条最短路径。希望能满足一些人的需要-used to achieve the maze procedure, automatically find the maze path and can find the most a shortest path. Hope to meet the needs of some
全国交通咨询系统
- 一 题目 全国铁路交通咨询系统 二 需求分析 1.系统配制: 硬件:CPU:P4 1.6G 内存容量 256M 标准输入输出设备 软件:操作系统Windows xp 源程序调试工具VC6.0 可执行文件运行工具 DOS 5.0. 2.该系统有供用户选择的菜单和交互性。 3.建立一个全国铁路交通咨询系统,该系统具备自动查找任意两城市间铁路交通的最短路径和最少花费的功能。 三 设
Dijkstra_router
- Dijkstra最短路径算法,稍作修改亦可作为最短路由算法-Dijkstra shortest path algorithm, can be slightly amended as the shortest routing algorithm
最短路径的求解
- 本实验中的问题是一个逻辑问题,而实验的目的是运用邻接矩阵解决图存储并解决在此结构情况下对矩阵中元素的扫描计算。其关键是怎样储存和计算。储存用的是邻接矩阵,而计算是用迪杰斯特拉算法。-experiment of the problem is a problem of logic, and The purpose of this experiment is to use the adjacency matrix storage solut
5班8号周前平第2题
- 单源最短路径问题。从文件中读入一个图,求一个顶点到其它所有顶点的最短路径。-single source shortest path problem. Reading from the document into a plan and seek a culmination of all the other vertices in the shortest path.
RBFS_CODE
- RBFS算法(递归最佳优先搜索:A*家族)和LRTA*算法(联机局部搜索,又名实时学习A*搜索,同为A*家族)实现图的单源最短路径。其中RBFS和LRTA*算法均比狄杰算法效率高! -RBFS algorithm (recursive best first search :* A family) and the LRTA* algorithm (online local search, also known as real-time
BoundAndBranch
- 我的算法作业,求一个在总花费小于1500的条件下从源结点到目的结点的最短路径,源代码Tree.cpp(C++语言编写,VC++6.0 IDE下调试通过),利用的是分支定界算法。可执行文件Tree.exe说明在ReadMeFirst请按照说明使用。-algorithm operations, for a total cost of less than 1,500 from the source node to node purpose o
RGIS
- 用vc和mo开发的很有用的例子,实现了图形的显示、查询、漫游等,并实现了最短路径查询-with vc mo and the development of useful examples and achieve a graphical display, query, roaming, and to achieve the shortest path inquiries