资源列表
shuju
- 数据结构实训报告
gg
- 在VC++中利用单链表方法实现数据结构中的二路归并排序。-In VC++ in the use of a single method of data list structures merge sort Rd.
dsshangji
- 这是我的数据结构的上机实验报告，希望对大家有所帮助-This is my data structure report on the experiment, I hope all of you to help
shudebianli
- 这是我的数据结构的上机实验报告，希望对大家有所帮助-This is my data structure report on the experiment, I hope all of you to help
spfa
- 一个求最短路径的代码，用spfa算法做的-A shortest path for the code, spfa algorithm used to do
binarytree
- 重构二叉树的一个算法，如何用二叉树解决问题-Reconstruction of a binary tree algorithm, how to solve the problem tree
yinghanjia
- 这是操作系统的银行家算法，实验源代码，共同分享吧-This is the operating system of the banker' s algorithm, the experimental source code and share it
zong
- 这是数据结构c语言课本的几个常用算法代码。有广度和深度优先遍历。最小生成树，最短路径，拓扑排序。-This is the data structure of c language textbooks code of several commonly used algorithms. Have the breadth and depth-first traversal. Minimum spanning tree, shortest path, topological sort.
duichengjuzhen
- 对称矩阵相乘：2. A和B是两个n×n阶的对称矩阵，以行为主序输入对称矩阵的下三角元素，压缩存储存入一维数组A和B，编写一个算法计算对称矩阵A和B的乘积，结果存入二维数组C。-Symmetric matrices: 2. A and B are two n × n symmetric band matrix, in order to conduct the main sequence of input symmetric matrix elements of lower triangular,
maandian
- 找马鞍点：1. 若在矩阵Am×n中存在一个元素A[i][j]，其满足A[i][j]是第i行元素中最小值，且又是第j列元素中最大值，则称此元素为该矩阵的一个马鞍点。用二维数组存储矩阵Am×n ，设计算法求出矩阵中所有马鞍点。-Find a saddle point: 1. If in the matrix Am × n, there is a element of A [i] [j], the meet A [i] [j] is the first line element in the mini
jiaohuanzuoyouzishu
- 已知二叉树采用二叉链表存储结构，编写一个算法交换二叉树所有左、右子树的位置，即结点的左子树变为结点的右子树，右子树变为左子树。-Known binary tree using linked list storage structure, the preparation of a binary tree algorithm for the exchange of all the left and right subtree of the location, that is, the left no
tongjierchashujiedian
- 采用二叉链表结构存储一棵二叉树，编写一个算法统计该二叉树中结点总数及叶子结点总数。-Binary list using a binary tree structure of storage, the preparation of a statistical algorithm of the binary tree nodes and the total number of the total number of leaf nodes.