-
017
广度优先搜索及深度优先搜索,用C语言实现,比较使用(Breadth-first search and depth first search, using C language, compared with)
- 2011-07-09 15:27:40下载
- 积分:1
-
Brute-force-algorithm
穷举算法,VC中的经典程序之一,适合初学者,(Brute-force algorithm, the the of the classic procedures in in the the VC, suitable for beginners)
- 2012-06-06 21:20:06下载
- 积分:1
-
paixu
实现冒泡,快速,希尔排序法。并计算,比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
- 2012-05-21 22:13:12下载
- 积分:1
-
0728-0708-0704
北邮数据结构课程设计大作业之旅行模拟查询系统。可实现多线程多旅客、中途更改计划、动态显示旅客状态等多个需求。已通过验收。(BUPT curriculum design travel query system simulation of large operations. Multithreading enables passengers to change plans midway, dynamic display multiple demands guest status. It has passed inspection.)
- 2021-03-14 12:09:23下载
- 积分:1
-
Introduction-to-Algorithms
算法导论的英文版,讲解算法的非常经典的书。(English version of Introduction to Algorithm. A classical book to teach algorithm.)
- 2015-09-14 16:44:34下载
- 积分:1
-
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
-
edge-betweenness
计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
- 2021-05-15 01:30:03下载
- 积分:1
-
mowang-language
魔王语言:输入一串字符,可自动翻译成一串语言。(the program of language)
- 2014-07-12 21:57:27下载
- 积分:1
-
elevator
电梯模拟,实现一个模拟电梯的环境,用C程序实现的,封装良好(elevator modify)
- 2021-04-22 15:38:48下载
- 积分:1
-
xianxingbiaolianjie
线性表的链接实现可利用单链表来实现,每个节点存储一个元素。
利用单链表来实现线性表的元素的插入,删除,修改等功能。
(Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
- 2011-04-26 11:57:25下载
- 积分:1