资源列表
KMP
- 实现字符串内指定字符的快速查找，使用了KMP算法-Quickly find specific characters within the string, using the KMP algorithm
tu
- 数据结构有关图的编写的原代码，图的一些存储结构-Data structure of the map prepared by the original code, some of the storage structure of Figure
proj3_4
- 对链队的各种操作，例如链队中各元素的出入，查看元素个数，释放地址空间等操作-Chain team for a variety of operations, such as the elements of the chain out of the team, view the number of elements, the release of address space and other operations
maze
- 这是基于堆栈的结构的寻找有效出口的程序。实现了堆栈的基本操作 很适合教学使用-This is based on the structure of the stack to find effective exit procedures. To achieve the basic operation of the stack is very suitable for teaching the use of
josephus
- jisophus算法，是数据结构的例题，仅供参考哦-jisophus algorithms, data structures are examples for reference purposes only oh
c4.5r8
- c4.5r8 数据挖掘 分类算法-c4.5r8 data mining classification algorithm
Mobile-phone-directory
- 实现的是类似手机通讯录， 实现以下功能： 1) 通讯录编辑（添加、删除）； 2) 按不同的项进行查找； 3) 对已存在的通讯录按不同的项排序； 4) 将通讯录写入文件； 5) 从文件读入通讯录。 -Implementation is similar to the phone contacts, the following functions: 1) Address Book editing (add, delete) 2) Find different
haffman
- 一个哈夫曼编码和译码程序 1、掌握树、森林和二叉树的概念和它们的特性以及它们之间是怎样相互转换的，理解二叉树的三种遍历：先序遍历、中序遍历和后序遍历，和树的两种遍历：先序遍历和后序遍历。 2、理解二叉树的基本运算算法实现以及它的非递归运算算法和层次遍历算法，了解二叉树的线索化及其它的应用。 3、掌握树和二叉树的几种存储结构以及它的构造，学会使用二叉链表实现二叉树的存储验证和设计相关算法。 -A Huffman encoding and decoding procedures fo
TeachingPlan
- 教学计划编制问题，程序实现两种编排策略：1使学生在各学期的学习负担尽量均匀；2是使课程尽量集中在前几个学期中-Teaching planning issues, program scheduling two strategies: one to enable students to learn as much as possible the burden evenly in each semester 2 is to try to focus on the course in the firs
proj3_1
- 桟的各种操作，入栈、出栈操作，判断栈是否为空等操作-Zhan' s various operations, stack, stack operation, waited in vain to determine whether the operation of the stack
lianbiao
- 单链表的实现 创建，修改，指定位置添加，删除，遍历等-The realization of a single listCreate, modify, delete, add the specified location, traverse
Graph
- 全面的讲述了数据结构中图这一章的重点难点，对于初学者有很好的指导作用。-About data structures in this chapter, the focus of difficulty, a good guide for beginners.