ddt

这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)

C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)

迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)

该文件描述了排序算法的实验指导报告，通过本实验，你可以了解插入排序、选择排序、希尔排序、堆排序、冒泡、双向冒泡、快速排序、归并排序、递归的归并排序、基数排序等多种排序方法的实验(The document describes the experimental guidance of the sorting algorithm, through this experiment, you can learn about the insertion sort, selection sort, shell sort, heap sort, bubble, two-way bubble, quick sort, merge sort, merge sort recursive basesorting a variety of sorting methods experiment )

用VC++编写中值滤波的算法，具有图形界面(The algorithm of Filter ，which use VC++)

实现回溯算法，能解决八皇后问题等～～算法结果优化，时间复杂度较小(Implement backtracking algorithms can solve the eight queens problem, etc. ~ ~)

单链表的插入。数据结构中的算法小程序。初学者很适用。(Single-linked list insertion. Data structure of algorithm applet. Beginners are applicable.)

任务：实现Dijkstra算法 工程名：Project_ShortestPath 要求：实现Dijkstra算法，算法主体写在CGraph类中；要求是从command窗口中输入源节点编号，并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注：要输出整条路径，而不仅仅是前一跳，也不允许逆序输出。 (Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)

本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )

说明：  高速多字符串匹配程序，基于多字符串的KMP算法开发，能够实现多字符串的匹配(High-speed multi-string matching procedure, based on multi-string KMP algorithm development, to achieve multi-string match)