登录
首页 » Visual C++ » chain

chain

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

代码说明:

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

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

发表评论

0 个回复

  • suanfa
    匈牙利算法以及指派问题介绍,kM算法和匈牙利算法的程序代码(Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code)
    2011-09-10 09:42:39下载
    积分:1
  • maze
    说明:  由数字1和0组成迷宫,0代表可走路径,程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)
    2011-03-27 20:57:47下载
    积分:1
  • data-struct
    对于数据结构每一章节的相应的练习题,巩固好数据结构(To consolidate data structure corresponding practice questions for each chapter of the data structure)
    2012-10-09 17:03:41下载
    积分:1
  • fibonacci-heap
    斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)
    2013-09-17 18:02:59下载
    积分:1
  • function
    提供字符串方法,大家面试可以用,包括找出对称字串(Some string function)
    2011-05-14 23:14:49下载
    积分: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
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • mowang-language
    魔王语言:输入一串字符,可自动翻译成一串语言。(the program of language)
    2014-07-12 21:57:27下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • Kruskal
    克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
    2009-06-27 01:43:39下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载