-
Test6
最短路径算法。
用无向带全图的邻接矩阵存储图,确定从源点出发到其它各点的最短路径。
输入:图中包含的顶点数n 边数m, 各边权值,用邻接矩阵或者邻接表存储。
输出:源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)
- 2014-05-11 17:05:37下载
- 积分:1
-
yuesehuhuan
就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)
- 2007-11-22 11:35:10下载
- 积分:1
-
maopao_youhua
冒泡优化:
如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。
思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency.
Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
- 2012-04-18 00:33:45下载
- 积分:1
-
a
说明: 100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)
- 2010-11-19 23:24:18下载
- 积分:1
-
sstring
利用串来比较数据大小,代码中有两个串,通过串来比较大小(
10/5000
Use the string to compare the data size)
- 2016-12-20 17:05:29下载
- 积分:1
-
code
各种数据结构代码,欢迎下载,里面有JAVA,C,C++等等各种版本(Data structure and code, please download)
- 2010-06-22 11:11:45下载
- 积分: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
-
c语言,码图合集
说明: a set of uestc computer academic matu
- 2020-04-05 20:19:20下载
- 积分:1
-
BeiDa_ACM1702
北大ACM1702题 转换为3进制
很经典(NULL)
- 2009-12-08 11:31:40下载
- 积分:1
-
migong---cPP
迷宫问题C++代码。。。解决迷宫问题。。。。(Maze C++ code. . . Solve maze problems. . . .)
- 2011-11-03 22:28:30下载
- 积分:1