Dijkstra

里面有50例经典算法，其中包括水仙花素，兔子的繁殖等古典问题的求解(There are 50 cases of classic algorithms, including daffodils prime, rabbit breeding classical problem solving)

n皇后问题构造法实现，比起启发式修补运行时间较长。(n Queen realize the issue of construction method, compared to a longer run-time heuristic repair.)

最小生成树C语言程序，提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)

说明：  详细介绍了游戏设计的数据结构注意事项，对与游戏中角色和游戏模式作者给予了督导的见解，书中语言为全英文但通俗易懂！很是推荐 (Data.Structures.For.Game.Programmers Detailed data structure of the game design considerations, the role with the game and game modes of supervision given to insights, the book in English but the language is easy to understand! It is recommended)

二叉树的链式存储、先序中序遍历和层次遍历。（构造一棵树并输入数据，编写三个函数，非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法（这里的非递归以中序为例）。在主程序中调用这三个函数进行树的遍历，观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。）(Chain store binary tree, preorder traversal and hierarchy traversal.)

此代码为折半查找算法，适用于有序表，欢迎各位下载(This code is the binary search algorithm for ordered lists )

单链表的增删查改功能,可以实现单链表的创建、传入数据；并能实现对已有单链表的插入数据、删除数据等功能。(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.)

约瑟夫环，数据结构算法，挺有意思，看看，看看(ysphdfgfgf)

有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)

Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)