-
LINK
建立链表的算法:
新节点链入表尾建立链表:
动态分配第一个节点变量;
用指针head 妥善保存链表第一个节点的地址值;
依次动态分配一个新节点变量;
将上一个节点的指针域指向新生成的节点;
循环3),4)步骤,直到所有节点均连入链表;
将最后一个节点的指针域赋值为0;
(Establish the list of algorithms:
The new node links footer build list:
Dynamic allocation of the first node variable
Keep the list head pointer of the first node address value
In order to dynamically allocate a new node variable
The domain of a node pointer to the new generation of nodes
Cycle 3), 4) step, until all nodes are connected to the chain
Pointer field will last node assigned to 0 )
- 2015-01-05 16:03:48下载
- 积分:1
-
Windows
Windows下的32位汇编语言程序设计(罗云彬).pdf,(Windows, 32-bit assembly language programming (Luoyun Bin). Pdf,)
- 2010-06-04 21:43:39下载
- 积分:1
-
GA_and_ACO_TSP
使用遗传算法和蚁群算法求解TSP问题,并且
实时地将计算结果和所用时间等信息显示在界面上,很直观。(The use of genetic algorithms and ant colony algorithm for TSP problem, and real-time results and the use of the time information is displayed in the interface is very intuitive.)
- 2010-09-03 21:45:37下载
- 积分:1
-
用C#做的一个唱票系统,效果还行o(∩_∩)o...。
用C#做的一个唱票系统,效果还行o(∩_∩)o...。-With C# Tellers make a system, the effect also line o (∩ _ ∩) o. ...
- 2022-05-05 14:28:31下载
- 积分:1
-
原始套接字测试,组装自己的链路层包
原始套接字实现的简单抓包,以及利用原始套接字测试链路层的通信,有说明文档,有代码注释
- 2022-10-01 03:10:07下载
- 积分:1
-
pk1.05ym
C#语言开发的自动排课系统,运行在ASP.NET软件上。(C# language to develop an automatic Timetable system software running on ASP.NET.)
- 2009-05-27 10:30:55下载
- 积分:1
-
greedy-snake
vs用c#语言编写的贪吃蛇小程序,可以拿来学习c#(vs c# language with Snake small program that can be used to learn c#)
- 2013-07-17 17:48:41下载
- 积分:1
-
5
说明: 1、 创建图类,存储结构使用邻接矩阵。
2、 输入图的节点数n(不超过10个)、边数m,节点分别用1-n代表。
3、 采用“起始节点,终止节点,权值”输入图的m条边,创建图。
4、 输出从节点1开始的BFS遍历,在遍历过程中,如有多个可以选择的节点,则优先选择编号较小的节点。
5、 输出从节点1开始的DFS遍历,在遍历过程中,如有多个可以选择的节点,则优先选择编号较小的节点。
6、 输出从第1节点到第n节点最短路径的长度,如果没有路经,输出0。(1. Create graph class and use adjacency matrix in storage structure.
2. The number of nodes n (no more than 10) and edge m in the input graph are represented by 1-n, respectively.
3. Create a graph by using the m-edges of the input graph of "Starting Node, Terminating Node, Weight Value".
4. Output BFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred.
5. Output DFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred.
6. Output the length of the shortest path from the first node to the n node. If there is no path, output 0.)
- 2019-02-19 14:49:05下载
- 积分:1
-
BM算法
完整BM算法,输入例:101010111010101001110100011
- 2022-03-13 11:34:58下载
- 积分:1
-
HOMEWORK_9
**this program finds the location of a number in an array while the array
**has been entered from the biggest number to the smallest number
- 2010-04-03 14:32:34下载
- 积分:1