Data_Struction_prim_MST

数学建模经典算法，是一系列解决问题的清晰指令，算法代表着用系统的方法描述解决问题的策略机制。也就是说，能够对一定规范的输入，在有限时间内获得所要求的输出。是一系列解决问题的清晰指令，算法代表着用系统的方法描述解决问题的策略机制。也就是说，能够对一定规范的输入 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

数据结构课设--英语词典的维护和识别--Trie树(Data structures course set- English dictionary maintenance and identification- Trie tree)

开括号和比括号的匹配，数据结构内容，很不错(More than brackets and brackets to open the match, the contents of data structure)

数据结构二叉树，及其遍历，镜像，输出等相关操作C++源码。(Binary tree data structure and its traversal, mirror, output the operation C++ source.)

My realization of binary tree. This example is search tree.

使用VC编写的约瑟夫环程序，简单明了，方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)

/* shiyan.c 第四组数据结构实验作业。Author:zhg 功能：本程序用于验证函数 LocateElem(L,e,compare()) 。即求出现行表中元素的位序。 程序中的线性表采用顺序存储，以更方便于该操作的实现。 */ (/* shiyan.c fourth group structure of the experimental data. Author : zhg function : This procedure is used to validate function LocateElem (L, e, compare ()). Calculated that the existing table spaces sequence elements. Procedures using the linear sequence of storage, in a more convenient to the realization of the operation.* /)

已知二叉树的先序遍历结果，建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)

马踏棋盘的贪心算法，8*8棋盘，基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)

将一个数进行阶乘结果会是一个很大的数，在c语言里double型也最大只能存一个两位数的整数的阶乘。本算法是对大数进行阶乘计算。(Factorial of a number of results will be carried out is a very large number of languages in the c-type double can only keep the largest of a double-digit integer number. This algorithm is the factorial of large numbers for the calculation.)