GraphTheory

数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)

实现栈的基本操作，建栈，进栈，出栈，数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)

使用VC编写的约瑟夫环程序，简单明了，方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)

说明：  离散随机线性系统的卡尔曼滤波。 其中13lman.c是卡尔曼滤波函数，4rinv.c是滤波函数中用到的矩阵求逆函数，13lman0.c是主程序。(discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the main program 13lman0.c.)

效验算法单循环链表，这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的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.)

单链表的增删查改功能,可以实现单链表的创建、传入数据；并能实现对已有单链表的插入数据、删除数据等功能。(Single linked list of additions and deletions check change function, you can achieve the creation of a single list, incoming data insert data of existing single linked list, delete data and functions.)

用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)

学数据结构自己总结的东西，希望对大家有所帮助。(Learn data structure sum things up, we want to help.)

希尔排序，希尔排序，希尔排序，希尔排序，c语言(shell sort)