登录
首页 » Visual C++ » SeqQueue

SeqQueue

于 2013-06-15 发布 文件大小:680KB
0 257
下载积分: 1 下载次数: 1

代码说明:

  数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)

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

发表评论

0 个回复

  • Josephus(data_struct)
    数据结构中基于约瑟夫环问题,用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)
    2013-11-17 11:30:24下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • dxsjjc
    多项式加减乘 用数据节够得算法实现多项式的加减乘 原理简单易懂(suoxiangshi jiajiancheng)
    2009-12-29 11:13:13下载
    积分:1
  • 1
    可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
    2013-11-13 21:16:53下载
    积分: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
  • PolynomialCoeff
    NTL应用——大数系数多项式乘法的计算。从文件读如参数,计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )
    2021-04-11 09:58:58下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • Joseph
    说明:  约瑟夫问题,四种解法,分别是静态链表,顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)
    2010-04-23 08:20:53下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • MyGPS
    1>实现可以随意浏览任一景点的介绍。(功能一) 2>可以给出任意两个景点的最短距离及其路线。(功能二) 3>可以查看任一景点热度,并可以对对所有景点热度(访问次数)进行排序。(功能三) 4>每个景点相关内容从文件读取,实现对文件操作的练习。 (1> implementations can feel free to browse introduce 任一景 points. (Function a) 2> You can give the shortest distance and route between any two attractions. (Function b) 3> You can view Renyi Jing point heat, and heat can all attractions (visits) to be sorted. (Function c) 4> each spot related content file reading, to achieve the file operations exercises.)
    2015-11-12 22:16:01下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载