▍1. 4
对于给定的一个工程施工图,该图以边为单位从键盘输入,编写能够找出该图的关键路径的程序。(For a given a construction graph that side for the unit to input from the keyboard, write to identify the critical path of the graph program.)
一份用于大学的数据结构教学的教学课程课件(A university teaching data structures courseware)
为了点分 求分下载好麻烦 c++二叉排序树(In order to find points dotted download good trouble c++ binary sort tree)
简单的队列实现,从中可以学习到怎样实现队列的算法编程(Simple queue implementation, from which you can learn how to achieve the queue algorithm programming)
在Visual Studio 2008运行成功 数据结构 二叉查找树的类(In Visual Studio 2008 running a successful binary search tree data structure classes)
USACO中的American heritage,用C++编写,运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)
希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )
希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )
双链表的定义和插入算法,双链表的定义,删除,插入和查找算法(Doubly linked list of definitions and insertion algorithm, the definition of double-linked list, delete, insert, and search algorithm)
双链表的定义和插入算法,双链表的定义,删除,插入和查找算法(Doubly linked list of definitions and insertion algorithm, the definition of double-linked list, delete, insert, and search algorithm)
使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
用于完成对学生的信息的管理,可以通过学号来删除或加入成员等一系列操作(For the completion of student information management, you can learn sign to remove or add members to a series of operations)
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
说明: 进程死锁.资源分配图的绘制 建立所需数据结构; 使用题目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 )
几个比较好的初级算法,初学者可以看一下思想,对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)
数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
以一个m*n的长方阵表示迷宫,0和1分别表示迷宫中的通路和障碍。设计一个程序,对任意设定的迷宫,求出一条从入口到出口的通路,或得出没有 通路的结论 (To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)