搜索资源列表
A-Star_4
- A-star 问题找到最短路径 结合了遇到障碍物问题。-A-star to find the shortest path with obstacles encountered problems.
EightFigure(A-Star)
- 经典的八数码问题,重在相互交流(A*算法实现).-eight digital classic problem lies in mutual exchanges (A * algorithm).
8数码问题 A星算法求解
- 8数码问题的A星解法-8 issue of A Star Solution
A-star(vb)
- 初学A*算法的很好源码，基于最短路径规则
A Star算法源代码
- A * 算法的源程序，给定地图，可以从开始地点寻找路径到目的地。-This is a * arithmetic source code, appointed a map, it can search route from start spot to destination.
star
- 在mdi client窗口的客户区域显示移动的星星的程序-Mdi client window in the customer area of the stars shows that the procedures for mobile
AStar
- 演示一个寻找最短路径的算法。-find a demonstration of the shortest path algorithm.
刘方然，机本013班11号
- 这是使用Java编写一个模仿星际全屏界面的我的Java课程设计。可以选中画面上的单元，并命令其像某点运动（跟星际的操作一样，左键选中，右键确定目的地）。机器的如不支持程序中的分辨率，文字显示可能会有问题。还有就是JDK要1.4以上。-This is written in Java interplanetary imitate a full-screen interface of my Java curriculum design. Im
CS编的Dijkstra算法(图形界面)
- Windows应用程序，C#编写，实现了求最短路径的Dijkstra算法，方便操作，可以自已在程序界面上指定每一个点的位置，在界面上空白的地方每点击一下生成一个点（该点是一个可以点击的按钮），这些按钮按照出现的先后顺序自动从1开始编号（目前程序设定最多支持100个点，可自行更改）。界面右上角是计算结果显示区，往下是权值输入区和“连线”、“清屏”“计算”三个按钮以及状态区，状态区显示当前的起点和终点，连线和计算都要用到该信息（点击生成的顺
stars
- 程序源码。通过编译，运行成功。原题：Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and no
8_nums
- 一个九宫问题的源码，a星算法，深度优先广度优先算法都有-a JiuGongTu the source, a Star algorithm, depth-first algorithm has breadth priority
starplot
- Star plots - MATLAB files for Graphical Representation of trace elements of clinkers-- MATLAB files for Graphical Rep. resentation of trace elements of clinkers
EightFigure(A-Star)
- 经典的八数码问题,重在相互交流(A*算法实现).-eight digital classic problem lies in mutual exchanges (A* algorithm).
search_arithmetic
- 常用搜索算法，包括数码游戏、黑白棋、STAR算法-commonly used search algorithm, including digital games, reversi, STAR Algorithm
astardemo
- 基于优化的A星算法的最优路径最短路径规划问题(A star algorithm and path planning)
A星
- 完整的A星寻路实现效果展示，带有路径展示(Complete A star pathfinding to achieve the effect of display, with path display)
A星算法自寻路
- A星算法自寻路的C及C++实现，并在窗口中实现路径的起点、终点、障碍，最后显示路径。(C and C++ implementation of self routing of A star algorithm)
A-Star
- 读取数字地图文件，增加地图障碍，利用A*算法解决三维路径规划问题。(Read digital map files, increase map obstacles, and use A* algorithm to solve the problem of three-dimensional path planning.)
A星寻路
- 通过指定的栅格地图，运用A星算法得出最短路径(Through the specified grid map, the shortest path is obtained by a star algorithm)