-
Kruskal
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
- 2009-06-27 01:43:39下载
- 积分：1
-
Anorldi
关于Arnoldi算法的今年来的中文资料，希望能够给有兴趣编写这方面算法的人提供帮助(Arnoldi algorithm on the Chinese data this year, hoping to write this algorithm are interested in helping people)
- 2011-10-22 10:26:34下载
- 积分：1
-
migong---cPP
迷宫问题C++代码。。。解决迷宫问题。。。。(Maze C++ code. . . Solve maze problems. . . .)
- 2011-11-03 22:28:30下载
- 积分：1
-
LongestIncreasingSequence
找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)
- 2011-09-05 17:36:27下载
- 积分：1
-
sstring
利用串来比较数据大小，代码中有两个串，通过串来比较大小(
10/5000
Use the string to compare the data size)
- 2016-12-20 17:05:29下载
- 积分：1
-
GraphTheory
讲述数据机构的图论部分和程序设计的关系，适合学习算法的同学学习阅读，很不错的一本书。(Graph theory algorithm and programming)
- 2013-12-04 20:12:39下载
- 积分：1
-
Numbersequence
说明： 简单的数据结构算法 在POJ上的题目 利用C++实现(Simple data structure algorithm in POJ on the subject using C++ Implementation)
- 2010-05-04 19:03:45下载
- 积分：1
-
xiaobaishu
参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写，很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
- 2013-08-29 16:09:43下载
- 积分：1
-
car
停车场管理系统 c语言实现
停车场拥有M个车位和一条进入停车场的便道，便道上最多停放N辆汽车。汽车要想进入车位，首先进入便道等候。若有空闲车位，则停车入位，否则在便道继续等候，直至有车位空出。若便道已经停满等候的汽车，后到达的汽车只能离开，选择其他停车场。设计一个停车场管理系统，模拟停车场的运作，并统计停车场的收入。(Parking Management System with M c language parking spaces and a sidewalk into the parking lot, parked up on the sidewalk N cars. To enter the car parking spaces, first into the pavement waiting. If free parking, the parking into place, or in the sidewalk to wait until the needed spot. If the sidewalk is already full of parked cars waiting, after the arrival of the vehicle to leave, choose a parking lot. Designing a car park management systems, simulation parking operations and parking revenue statistics.)
- 2011-08-21 21:55:11下载
- 积分：1
-
a
说明： 100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)
- 2010-11-19 23:24:18下载
- 积分：1
