资源列表
duipaixu
- 数据结构的课程设计，要求用堆排序实现prim算法的最小边的权值选择，改的程序，调试了，可以运行-Data structure curriculum design requirements heap sort prim algorithm of minimum weight edge select change program, debug, you can run
Java_SoftwareDesign_Competition
- 一些自己写的JAVA大赛的源码，与大家分享-Some JAVA contest to write their own source code, to share with you
Snooker-Referee
- 解决ZOJ 3426 & HDU 3719 Snooker Referee的问题，实现斯诺克智能裁判的功能。-Solve the problem of ZOJ 3426 & HDU 3719 Snooker Referee snooker intelligent referee function.
huadongchuangkou
- 使用Java编写的模拟滑动窗口协议，部分修改可实现停等、回退N帧以及选择重发功能-Analog sliding window protocol written in Java, the partial revision of the stop-and-wait fallback N frame retransmission function
linksqelist
- 能够自动调用链表的构造函数和析构函数，能对链表进行插入、删除操作，若不能，则程序能够报错。-The linked list can automatically call the constructor and destructor of the linked list, insert and delete operations, if not, the program is capable of error.
linjiejuzhen
- 能够输入输出一个图的邻接矩阵，能够对相应的边和顶点进行插入删除操作，能够进行深度和广度优先搜索遍历-The adjacency matrix of a graph can be input and output, insertion and deletion operations to the corresponding edges and vertices, depth and breadth-first search traversal
zhan
- 能够将一个输入的中缀表达式（数字为一位或两位数）转换成后缀表达式，并能求出表达式的值。-Convert an input infix expression (figures for the one or two digits) the the suffix expression, and to evaluate the expression.
5
- 数据结构中二叉树和二分查找的源代码，而且是二者的综合-The data structure in the binary tree and a binary search of the source code, but is a combination of both
maze.tar
- 回溯法求解老鼠走迷宫问题，使用C++语言的高内聚，低耦合的特点-Retrospective method of mouse maze problem
4
- 用四种不同的方法对图进行描叙和表示，还有这四种方法的比较-Four different methods of Figure Miao Xu and representation, as well as a comparison of four methods
erchashubianli
- 能够以广义表输入一个二叉树，并能对其进行前序遍历，中序遍历，后序遍历，层次遍历。-Generalized list, enter a binary tree, and its preorder traversal, in order traversal post-order traversal, traverse the level.
LinkList
- 基于链表的图书管理，包含插入，删除，查找，逆序等操作。-Linked list-based library management, including insert, delete, search, reverse and other operations.