登录
首页 » Visual C++ » ANT

ANT

于 2012-05-17 发布 文件大小:563KB
0 278
下载积分: 1 下载次数: 3

代码说明:

  A*算法通过启发式探索下一结点,逐步逼近目标结点,且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Fa_Pai
    关于随机发牌算法的小程序,作为数据结构的大作业,开发环境是VC(Random licensing algorithm for small procedures, as big job data structures, the development environment is VC)
    2014-10-16 17:54:20下载
    积分:1
  • Birch
    这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)
    2012-05-08 09:00:44下载
    积分:1
  • hafumanTree
    数据结构课程设计,在VC环境下完成,利用哈夫曼树原理,主要功能是实现字符的压缩和解压缩,设计脉络清晰,易懂(Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear structure, easy to understand)
    2011-01-02 13:15:23下载
    积分:1
  • maze
    一个苹果走迷宫,支持最短路径寻路。可以使用方向键操作,也可以用户自己添加迷宫格式文件,生成迷宫图。(Apple Maze, shortest path routing. Can use the arrow keys to operate, the user can add their own maze format generated maze.)
    2012-09-11 21:33:01下载
    积分:1
  • Untitled
    航迹起始中的逻辑航迹起始算法源代码,本代码具有很好的航迹起始效果! (Track initiation logic for track initiation algorithm source code, this code has the effect of track initiation)
    2012-06-06 21:35:20下载
    积分:1
  • linearlist
    说明:  线性链表的定义,遍历,查找,删除,排序。(Linear list definition, traversal, search, delete, sort.)
    2011-04-07 14:08:14下载
    积分:1
  • NoGo
    计算机博弈大赛不围棋的代码 个人所写,可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)
    2021-04-04 19:39:04下载
    积分:1
  • 1
    说明:  贪婪算法的简单描述 不过没做完 只是想下个程序 用用。。。。 (greed math)
    2012-04-26 19:56:56下载
    积分:1
  • InverseList
    说明:  链表逆转,实现单链表的逆转程序,数据结构(List Inverse)
    2011-04-04 11:15:58下载
    积分:1
  • Prim
    编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。 (其中随机生成点和边,形成连通图) 根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )
    2011-06-11 16:28:53下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载