-
Kruskal
采用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)
- 2011-05-17 10:22:56下载
- 积分：1
-
Ex3
c++实现的静态链表 可以从屏幕输入来构建静态链表 数据结构重要的部分(c++ implemented statically linked list can be input from the screen to the important part to build a static linked list data structure)
- 2012-11-27 15:19:25下载
- 积分：1
-
maze
说明： 由数字1和0组成迷宫，0代表可走路径，程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)
- 2011-03-27 20:57:47下载
- 积分：1
-
algorithm
王晓东教授所著的经典算法设计入门资料。语言通俗，适合初学者作为算法入门资料(Written by Professor Wang Xiaodong introductory information on the design of the classic algorithm. Popular language for introductory information for beginners as the algorithm)
- 2009-06-13 01:21:34下载
- 积分：1
-
graph-theory
数据结构图论问题，初学数据结构的学生可以通过这些简单的问题熟悉数据结构课程(Data structure graph theory problem, learning data structures for students through these simple questions can be familiar with the data structure courses)
- 2013-10-14 17:22:09下载
- 积分：1
-
c5
说明： 问题描述：字符序列的子序列是指从给定字符序列中随意地（不一定连续）去掉若干个字符（可能一个也不去掉）后所形成的字符序列。令给定的字符序列X=“x0，x1，…，xm-1”，序列Y=“y0，y1，…，yk-1”是X的子序列，存在X的一个严格递增下标序列<i0，i1，…，ik-1>，使得对所有的j=0，1，…，k-1，有xij=yj。例如，X=“ABCBDAB”，Y=“BCDB”是X的一个子序列。 (Problem Description: character sequence is the sequence of a given sequence of characters from arbitrarily (not necessarily consecutive) to remove a number of characters (perhaps a not removed) after the formation of character sequence. So that a given character sequence X = " x0, x1, ..., xm-1" , the sequence Y = " y0, y1, ..., yk-1" is a sequence of X, X, there is a strictly increasing sequence subscript <i0，i1，…，ik-1> So for all j = 0,1, ..., k-1, with xij = yj. For example, X = " ABCBDAB" , Y = " BCDB" is a sequence of X.)
- 2011-09-22 21:55:38下载
- 积分：1
-
JOSEPHUS
一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)
- 2011-08-13 10:09:20下载
- 积分：1
-
bag1
使用不同的方法解决背包问题：本算法采用的是动态规划方法，比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
- 2011-07-16 18:40:31下载
- 积分：1
-
Introduction to algorithms
说明： 《算法导论》原书名——Introduction to Algorithms，是2006年机械工业出版社出版出版的图书，作者是Thomas H.Cormen、Charles E.Leiserson等。(Introduction to algorithms)
- 2019-02-28 16:17:37下载
- 积分：1
-
erchashu
平衡二叉树操作，可以输入数字形成二叉树，可以进行添加、删除操作(Balanced binary tree operation, you can enter numbers to form a binary tree, the user can add, delete)
- 2011-12-23 10:26:26下载
- 积分：1
