的Kruskal最小生成树算法Mathematica软件应用

程序功能： 实现一元多项式的四则运算 ，用到的主要就是多现式的实现，除法实现起来是很复杂的。-procedures functions : achieving a polynomial of four operations is mainly used in the more- is the realization Apart from achieving up is very complex.

根据广义表创建一棵二叉树，然后中序线索化，再遍历。-Create a table based on generalized binary tree, and then in the sequence of clues, and then traverse.

二叉树- Two forks the tree

数据库设计指南，数据库的教程- Database design guide, database course

K路归并算法 * 本程序用来实现K路归并算法 * 在Turbo C2.0编译器下编译通过 * 算法过程中 * K由用户输入 * 用户选择需要归并的数据的个数 * 由程序生成随机数据，数据结构为链表，并展示给用户 * 然后程序告诉用户需要增加的虚节点的个数 * 并把虚节点加入到链表中去，最后进行归并 -K Road merge algorithm* This procedure used to realize the way merging algorithm for K* in Turbo C2.0 compiler compiler under the process through the* algorithm* K* by the user input the user select the number of merging the data* generated by the random data , data structure for the list, and display to the user* and then the procedure to tell the user the need to increase the number of virtual nodes and virtual nodes* added to the list going, and finally to merge

数据结构算法，aoe ，图的最小代价路径检索。-data structure algorithms, aoe, for the minimal cost path retrieval.

数据结构（清华版），数据结构课后小作业，选择其中较之重点而写 -Data structure (Tsinghua version), data structure after a small operation, select one of the focus than the written

大学毕业的课题,可能比较简单一点,入门的人可以-University graduate topics that may be relatively simple, entry can

货郎担问题的分支限界算法，速度很快，并且结点可以到达35个-The branch and bound algorithm for traveling salesman problem, very fast, and the node can reach 35

用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing