登录
首页 » Visual C++ » chain

chain

于 2013-12-09 发布 文件大小:1KB
0 190
下载积分: 1 下载次数: 3

代码说明:

  链表的模板类,提供插入删除,遍历器,查找等功能,只有一个头文件,可以包含到你的工程(template implemention of Chain)

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

发表评论

0 个回复

  • mofanwenti
    魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)
    2014-01-08 22:30:48下载
    积分:1
  • SqStack
    大学计算机专业教材《数据结构》中栈的实验、练习源码(University computer professional teaching materials" data structure" stack experiment, practice source code)
    2012-03-15 17:07:23下载
    积分:1
  • stuctures
    本系统采用C语言编写,利用邻接链表实现最短路径问题,关键路径问题等(The system uses the C language, using adjacency list realize the shortest path problem, critical path issues)
    2008-05-29 21:11:26下载
    积分:1
  • AOV-Sort-Algorithm
    使用C语言编写的AOV网的拓扑排序,内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)
    2011-10-26 16:34:29下载
    积分:1
  • SortDemo
    实现排序操作SortDemoSortDemo.rar,很不错的vc源码,希望对大家有所帮助。(To achieve the sorting operation SortDemo SortDemo.rar, very good vc source, we want to help.)
    2011-09-21 22:16:39下载
    积分:1
  • LongestIncreasingSequence
    找出数组A中最长的递增序列的长度,使用动态规划算法,复杂度为O(N*N)。(Find the longest increasing sequence)
    2011-09-05 17:36:27下载
    积分:1
  • lesson1-2
    棋盘覆盖,算法分析,很有用的东西,大家一起来分享一下(Board covers, algorithm analysis, useful things, we share together)
    2011-01-06 15:15:11下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • mapsearch
    数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
    2016-01-09 17:34:45下载
    积分:1
  • maopao_youhua
    冒泡优化: 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。 思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
    2012-04-18 00:33:45下载
    积分:1
  • 696516资源总数
  • 106474会员总数
  • 2今日下载