资源列表
Graph-traversal-spanning-tree
- 1．显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。 2．当用户选择的功能错误时，系统会输出相应的提示。 3．通过图操作的实现，把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree m
prim
- 用prim算法实现最小生成树，要求输出为图形界面，实现入选，交换，调整等的功能-Minimum spanning tree algorithm with the prim, the output for the graphical interface required to achieve selected, exchange, adjustments and other features
1111
- C语言和C++ 如何建立双向循环线性链表-C language and C++ of how to establish a two-way loop linear list
KRUSCAL
- Kruscal算法实现产生最小生成树，适用学习二叉树的朋友-Kruscal have a minimum spanning tree algorithm, the application of learning tree friends
11
- ... ... ... ... ... ... 银行家算法-ok
Floyd
- Floyd 算法，创建有向图，无向图，有向网，无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm
beibaowenti
- 动态规划求0/1背包问题sdfgsdfs-Dynamic programming seek 0/1 knapsack problem sdfgsdfs
RB-Tree
- 红黑树的实现，是一种高级的平衡树，平均效率为：lgn-Red-black tree implementation is a high-level balanced tree, the average efficiency: lgn
2(2)
- 计算24点的C程序（穷举法） 几年前，女朋友很喜欢和我玩计算24点的游戏，来测试谁的反应更快一些，结果我总是输而不得不承认在这方面她比我强。于是我就用C和我可怜的数据结构知识写了这个程序来挽回点面子，结果竟然让她很佩服。现在女朋友已经成功升级成老婆了，这程序也久没有用武之地了，就放在这里给和我们有一样故事的人们参考一下吧！ -Calculate the C 24-point program (exhaustive method) a few years ago, and my girlfri
kuohaopipei
- 用二叉树的各种遍历来实现括号匹配，里面有4个遍历-The binary tree traversal to brace matching, which has four traversal
chazao
- 通过c语言实现了二叉树的排序，这个源码可以运行，希望对你们有帮助。-C language, sort of binary tree, this source can run, you want to help.
zuijialujin
- 数据结构常用算法，求最佳路径的，供大家参考-data structures, algorithms, seeking the best path for your reference