资源列表
shiyanhezuoye
- 学校C语言课程的实验程序及要求，初学者可以参考-Experimental procedures and requirements of school C language programs, beginners can refer to see
b_search_tree
- c++实现的二叉查找树的相关操作，有二叉树的简历，插入，删除，查找，遍历-C++ realization of binary search trees of the relevant operation, have binary tree resume, insert, and delete, find, traverse
binarytree
- 自己编写的二叉树，实现最基本的功能，可以借鉴-binary tree
main
- 破圈法求图的最小生成树，破圈法是“见圈破圈”，即如果看到图中有一个圈，就将这个圈的边去掉一条，直至图中再无一圈为止。（其中破圈法的" 圈"指的是回路） -Seek the minimal spanning tree to break the circle method, breaking the circle method is to see the ring to break the circle ", that is, if you see a circle in the figure, w
main
- 图的深度优先搜索和广度优先搜索以及一个无向图的拓扑排序-Graph depth-first search and breadth-first search and topological sorting of a directed graph
exp
- 掌握简单匹配算法及模式匹配KMP算法的思想-Master the simple matching algorithm and pattern matching the thinking of the KMP algorithm
Student.txt
- 冒泡排序的源码，这是一个用C++编写的一个源码，解决排序问题- bubble sort
maze
- 简单的迷宫问题C++源码，数据结构中实习的题目——迷宫问题。-Simple maze problem C++ source code, practice topics in the data structure- maze.
combinations
- 求解Nn的k组合 用字典排序法求N(n k) c-Solving Nn of k combinations Dictionary-ordering Method and N (n k)
tree
- C语言经典二叉树基于链表格式的顺序重新最小排序-Classic binary tree sort
main
- 本程序，利用c语言实现了二叉树的建立，多种遍历，叶子的计算以及树深的计算！程序全部通过调试!-This program using c language to achieve the establishment of a binary tree, a variety of traversal, the calculation of the leaves and tree depth calculation. All the procedures through the debugger!
SolveAllPaths
- VC++开发的穷举图中指定起始点间所有路径的算法，图的存储格式为邻接矩阵。-Exhaustive diagram of the VC++ development specified in the algorithm of all the paths between the starting point, the storage format of the graph adjacency matrix.