搜索资源列表
GisPathFinder
- 自动实现最短路径的程序，图形显示。纯 vb语言实现，没有其他组件-Automatically realize the shortest path procedures, graphical display. Net vb language realize, there is no other component
trace
- 本程序设计了5条典型的航迹发生器，适用于许多仿真中产生飞行轨迹，包括滑行、起飞、加速、平飞、俯冲、拐弯、降落各个阶段。-This procedure was designed five typical track generator, applicable to many simulation generated flight path, including taxiing, takeoff, acceleration, level f
Floyd
- 基于MATLAB的 Floyd最短路算法-MATLAB-based shortest path algorithm of Floyd
fade
- 包括DS-CDMA 的衰落信道函数，多径衰落信道以及快衰落信道函数。-Including DS-CDMA in fading channel function, multi-path fading channel and fast fading channel function.
knight
- 求马的哈密顿回路,在国际相棋棋局上,一只马要经过每个点,且仅经过一次,棋局可以是非常大,要求输出马经过的所有点及路径.-Hamiltonian circuit for the horse in the international chess game of chess, the one horse to go through each point, and only after one game can be very large an
gdf
- 根据城市交通路网建设的实际, 研究了描述城市交通网络图的城市道路数据库的组织结构, 在此数据 结构的基础上依靠G IS 技术的支持, 采集了大量具体道路信息, 采用D ijk st ra 算法实现了快速最短路径搜索。根 据城市的交通状况对交通网络图的边值赋予不同的权值可实现最优路径搜寻, 给出了一个搜索实例——一个包 含61 个交通路口的最短路径搜索结果的搜索时间约为1. 1-Urban traffic network i
GAlujingguihua
- C语言环境下的基于遗传算法和栅格法的机器人路径规划程序-C language environment based on genetic algorithms and grid method of robot path planning process
GAAS
- 遗传算法与蚁群算法演示程序~ 城市间最短路径和曲线图-Genetic algorithm and ant colony algorithm demo program ~ the shortest path between cities and the curves
chen
- 蚁群算法动态寻路算法的机器人的全局路径规划-Ant colony algorithm dynamic routing algorithm for the robot global path planning
vp_flight_path
- This sample illustrates how to draw geometry to simulate the flight path of an object. This sample defines the class myApp, which is derived from vpApp, and uses a vsRenderStrategyfr a meGeometry to create dynamic path g
a_Path
- A*算法寻找最短路径，对此感兴趣的可以下载来看一下-A* algorithm to find the shortest path, which can be downloaded interested look
SplitPath
- 平台无关的路径拆分包裹类，方便处理目录结构。使用方便，构造时输入全路径，则可以通过成员函数获取相关的目录结构。-Platform-independent path split parcel category, facilitate the processing of directory structure. Easy to use, enter the full path, when constructed, you can acces
KShortestPath
- kth算法的实现，可找出第k次最短路径，给出优化方案-KTH algorithm can find the first k-shortest path is given to optimize the program
shortpath
- c#+arcengine实现最短路径分析-c#+ arcengine realize the shortest path analysis
mapxshortpath
- 利用delphi和arcinfo数据格式实现最短路径查询-Use delphi and ArcInfo data formats to achieve the shortest path query
04102301806
- 在vc集成环境下实现基于蚂蚁的算法的机器人路径规划-In the integrated environment vc realize the algorithm based on ant robot path planning
mobilerobot
- 在动态复杂环境下移动机器人路径规划问题，有很重要的参考价值-Complex in a dynamic environment of mobile robot path planning problem, has a very important reference value
200806
- 动态未知环境下移动机器人路径规划遗传算法-Dynamic unknown environment for mobile robot path planning genetic algorithm
15
- OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表，以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。 开放最短路径优先协议(Open Shortest Path First，OSPF)是目前最主要的内部网关协议之一。通过本课程设计，学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。 -OSPF is a rou
jiqiren
- 基于遗传算法的机器人路径规划问题．选择一条很好的路径-Robot based on genetic algorithm path planning. Choose a good path