资源列表
RamdomMincut
- 最小切割的近似算法。希望能够对大家有所参考-Minimum cut approximation algorithm. We hope to be able to reference
12
- 有4个小程序，有城市信息，分数查询，还有约瑟夫环，呃，都能运行的-There are four small procedures, city information, scores of inquiries, as well as Joseph Central, uh, can run
sy3
- 二叉树的基本操作， 1．以二叉链表表示二叉树，建立一棵二叉树 2．输出二叉树的前序遍历结果 3．输出二叉树的中序遍历结果 4．输出二叉树的后序遍历结果 5．统计二叉树的结点个数 6．统计二叉树的叶结点个数 7．计算二叉树的深度 -Binary Tree s basic operations, 1. List said in binary tree, the establishment of a tree 2. Bintree output the results
string
- 字符出现的次数 -The number of characters the number of characters appear
word
- 模仿word对英文字符的操作，输入一篇英文文章，可以对其段落进行剪切、复制、粘贴等操作，并可以计算其单词数和段落数-Word of English characters to imitate the operation, enter an English article, you can carry out their paragraphs cut, copy, paste and other operations, and can calculate the number of its wor
Floydalgorithm
- 用佛洛依德算法求有向带权图的所有顶点之间的最短路径-Freud algorithm used to bring order to have the right to map all of the shortest path between vertex
QueensProblem
- 求解皇后问题，在n*n的方格棋盘上，放置n个皇后，要求每个皇后不同列，不同行，不同左右对角线-Queen Solving problems in the square n* n chessboard, n-placed Queen s, Queen s required for each different column, different trip, different about the diagonal
danlianbiao
- c编的,数据结构实验报告,很详细.流程都有 是单链表交并差的-c allocation and data structure of experimental reports, in great detail. process is a single linked list has to pay and poor
guangyibiao
- 主要是实现广义表相关操作的算法，并包括有详细报告-Mainly related to the realization of the generalized form of the algorithm operation, and include a detailed report
erchashu
- 二叉树的各种遍历，用菜单形势实现的。前序中序后序层序-A variety of tree traversal, using the menu situation achievable. Preorder in sequence after sequence sequence
flash
- 数据结构中有关查找和排序，以flash格式表现算法是如何实现的。-Data structure relating to search and sort to flash format of the performance of algorithm is how to achieve.
huffman
- 哈夫曼编码^译码器 数据结构经典实验 我们大多数情况下作为参考-^ Huffman decoder data structure of our classic experiment in most cases as a reference