ecs

数据结构线性表教学笔记，内容讲基础知识，没基础可以看看(Linear table data structure teaching notes, basic knowledge content says, no base can take a look)

一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)

多项式相加的数据结构试验·············(Polynomial sum test data structure)

编程 主范式 使用真植表 用栈的应用 使用了 后缀表达式 (biancheng zhu fanshi)

采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)

用不多于四种颜色为地图染色，使相邻的行政区不重色，是计算机科学中著名的“四染色”的典型应用，应用这个思想，是以回溯的算法对一幅给定的地图染色。是对数据结构中栈的应用。(With no more than four colors map staining the adjacent borough is not heavy color, typical applications of computer science "stain" the application of this idea, a backtracking algorithm on a given mapstaining. The application of the stack data structure.)

画图法实验数据结构中二叉树先序、中序、后序遍历和显示。(Paint Method in the first order binary tree data structure, in order, post order traversal and display.)

Monkeys and peach,Monkeys and peach(Monkeys and peach)

二叉树的C++实现，成员可以自己调整，实现了各种修剪此树的方法：初始化，增加节点，删去节点，复制树，读取节点，遍历树(Binary tree in C++, members can make their own adjustments to achieve a variety of pruning this tree methods: initialize, add nodes, delete nodes, copy the tree, read the node, traverse the tree)

大学计算机专业教材《数据结构》中栈的实验、练习源码(University computer professional teaching materials" data structure" stack experiment, practice source code)