登录
首页 » Visual C++ » 20070320list

20070320list

于 2007-03-20 发布 文件大小:1KB
0 239
下载积分: 1 下载次数: 10

代码说明:

  包括链表的各项操作,添加、删除、修改等。还包括单项连标和双向链表。(including the operation, add, delete, revise. Also including individual targets and even two-way linked list.)

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

发表评论

0 个回复

  • hill-climbing
    改进爬山算法,用于风力发电机实现风能最大追踪,找到最佳叶尖速比,实现最大功率(modified hill-climbing algorithm for wind turbine with MPPT)
    2017-02-26 12:21:08下载
    积分:1
  • sort
    归并排序,复习排序算法,在不同环境下,寻找时间复杂度最少的排序算法( Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)
    2013-11-05 22:15:57下载
    积分:1
  • DLinkedList
    双链表的定义和插入算法,双链表的定义,删除,插入和查找算法(Doubly linked list of definitions and insertion algorithm, the definition of double-linked list, delete, insert, and search algorithm)
    2013-07-17 15:38:38下载
    积分:1
  • huffmancode
    哈夫曼编码程序,实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)
    2008-01-14 13:55:11下载
    积分:1
  • sort
    数据结构中数据的排序示例,包括堆排序、快速排序等(Data structure to sort the data sample, including the heap sort, quick sort, etc.)
    2008-06-14 20:52:24下载
    积分:1
  • GraphTheory
    讲述数据机构的图论部分和程序设计的关系,适合学习算法的同学学习阅读,很不错的一本书。(Graph theory algorithm and programming)
    2013-12-04 20:12:39下载
    积分:1
  • CarClass
    数据结构简单的课程设计交通换乘算法,里面有零次换乘与一次换乘(Simple structure, curriculum design data traffic transfer algorithm, which have zero time transfer and a transfer)
    2011-01-09 10:33:14下载
    积分:1
  • traversinggraph
    图的遍历的实现,文字界面,包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)
    2010-08-14 14:16:10下载
    积分:1
  • xiaobaishu
    参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
    2013-08-29 16:09:43下载
    积分:1
  • arrangement
    假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。) 对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
    2014-10-22 11:00:45下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载