登录
首页 » Visual C++ » structure-array-code

structure-array-code

于 2013-10-09 发布 文件大小:6003KB
0 118
下载积分: 1 下载次数: 1

代码说明:

  根据队列搜索算法的基本思想,现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能,可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of ​ ​ the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)

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

发表评论

0 个回复

  • xuanzexingjiegou
    选择型结构c语言编程 (Choose the type of structure of C language programming)
    2013-09-24 22:11:37下载
    积分:1
  • Phone-book
    数据结构课程设计 -电话本(运用了MFC图形化界面)(Curriculum design- the phone book)
    2015-03-09 22:04:07下载
    积分:1
  • test
    使用vc编写的一个动态链接库,测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)
    2010-05-28 23:27:09下载
    积分:1
  • maze
    实现经典问题老鼠迷宫,并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)
    2016-05-25 22:56:59下载
    积分:1
  • HuffmanTree
    用c++实现的haffman tree 小程序,仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)
    2013-03-14 16:38:15下载
    积分:1
  • jiajianfa
    长整数四则运算,利用双向循环链表实现长整数的存储,每个结点含一个整形变量。 (Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)
    2014-05-29 14:41:51下载
    积分:1
  • Simulation-of-dendritic-growth
    模拟枝晶生长,在统计学常用的一种算法,对随机理论有帮助。(Simulation of dendritic growth, the statistics used an algorithm, the stochastic theory.)
    2012-04-06 19:12:14下载
    积分:1
  • Hanoi
    简单的汉诺塔算法,采用归约算法的思想,实例是三个盘子,三个柱子(Simple HANOR algorithm)
    2012-07-16 20:48:59下载
    积分:1
  • Campus-navigation-problem
    校园导航问题,设计你的学校的平面图,至少包括10个以上的景点(场所),每两个景点间可以有不同的路,且路长也可能不同,找出从任意景点到达另一景点的最佳路径(最短路径)。 要求: (1)以图中顶点表示校园内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等有关信息。 (2)为来访客人提供图中任意景点相关信息的查询。 (3)为来访客人提供任意景点的问路查询,即查询任意两个景点之间的一条最短路径。 (4)修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)
    2011-08-12 10:34:14下载
    积分:1
  • ALGO3-9
    用于迷宫问题的解决用户根据根据要求进行设置即可在屏幕上显示(Maze problems for users in accordance with the requirements set can be displayed on the screen)
    2008-07-02 02:41:08下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载