登录
首页 » Visual C++ » lujing

lujing

于 2012-05-22 发布 文件大小:2KB
0 139
下载积分: 1 下载次数: 4

代码说明:

  图的邻接表生成,深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)

文件列表:

lujing.cpp,4985,2012-05-16

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

发表评论


0 个回复

  • fml
    已知二叉树的先序遍历结果,建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)
    2015-02-15 15:20:26下载
    积分:1
  • 2
    说明:  用链表的方式实现多项式的加减,其中结构体包含幂次和系数。(Polynomial addition and subtraction with a list of ways in which the structure and contains the power of coefficients.)
    2017-03-10 09:10:31下载
    积分:1
  • 3_abstract_data_struct
    数据结构:抽象数据类型的介绍;讲述如何构造函数和如何实现;(Data structure: the introduction of abstract data types on how to structure function and how to achieve )
    2008-04-14 22:56:33下载
    积分:1
  • ok-suit
    说明:  一个实现外部排序的程序,其中gnerate.cpp为产生一个随机的文件,用于被排序。而caculate.cpp为外部排序程序。(A realization of the external sort program, which gnerate.cpp to generate a random file for be sorted. The caculate.cpp external sort program.)
    2011-03-18 12:30:29下载
    积分:1
  • maze
    实现经典问题老鼠迷宫,并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)
    2016-05-25 22:56:59下载
    积分:1
  • Library
    数据结构课程设计 数据结构B+树 B+ tree Library(B+ tree Library)
    2009-05-18 14:07:25下载
    积分:1
  • Eight-Digital
    说明:  八数码 对任意数字序列重新排序 高级散列函数 MFC基础编程(Eight Digital Reorder the sequence of any number Senior hash function MFC based programming)
    2011-04-11 16:31:59下载
    积分:1
  • a
    说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
    2013-07-04 19:50:58下载
    积分:1
  • Data-structure
    说明:  分别用堆栈和数组的方法实现任何进制的数制转换(Arrays were used to stack and method of implementation of any binary number system conversion )
    2011-03-08 16:55:07下载
    积分:1
  • host2
    说明:  马踏棋盘算法编程,实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
    2006-04-30 00:12:21下载
    积分:1
  • 696518资源总数
  • 104684会员总数
  • 30今日下载