-
huisuo
实现回溯算法,能解决八皇后问题等~~算法结果优化,时间复杂度较小(Implement backtracking algorithms can solve the eight queens problem, etc. ~ ~)
- 2011-12-14 11:59:39下载
- 积分:1
-
Binary-tree-in-the-establishment
二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表(Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list)
- 2013-03-30 14:39:13下载
- 积分:1
-
1
可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
- 2013-11-13 21:16:53下载
- 积分:1
-
BiTree
本算法用于实现二叉树的查找和输出,使用了数据结构中的二叉树结构,精髓在于使用了函数指针。(
This algorithm is used to find and implement binary output, use the data structure of the binary tree structure, the essence is the use of function pointers.)
- 2016-04-05 17:09:03下载
- 积分:1
-
Data-structure-diagram
数据结构中图的存储结构的建立与搜索
建立图的二种存储结构
在不同的结构上实现遍历
(Data structure diagram of the storage structure of the establishment of the search to establish two kinds of graph storage structure in the different structures to achieve through)
- 2011-06-27 09:29:40下载
- 积分:1
-
zhaose
本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)
- 2013-09-23 16:04:24下载
- 积分:1
-
maze
迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
- 2013-12-13 17:55:45下载
- 积分:1
-
process_schedule
演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo
)
- 2011-12-24 10:52:17下载
- 积分:1
-
carpub
一个简单的停车场管理程序,是初级学习数据结构时的一个十分重要的实验,了解这个对学习堆栈十分有用,基本题目是
设有一个可以停放[size=10.5pt]N[size=10.5pt]辆汽车的狭长的停车场,[size=10.5pt] [size=10.5pt]它们有一个大门可以供车辆进出。车辆按到达停车场时间的先后次序从停车场最里面向门口处停放(最先到达的第一辆车停在停车场的最里面)。如果停车场已放满[size=10.5pt]N[size=10.5pt]辆车,则后来的车辆只能在停车场大门外的便道上等待,一旦停车场内有车开走,则排在便道上的第一辆车就可进入停车场。停车场内如果有某辆车要开走,在它之后进入停车场的车辆都必须先退出停车场为它让路,待其开出停车场后,这些车辆再依原来的次序进入。每辆车在离开停车场时,根据它在停车场内停留时间的长短交费。如果停在便道上的车辆未进入停车场就要离去,允许其离去时不收停车费,并且仍然保持在便道上等待的车辆的次序()
- 2007-09-05 20:25:00下载
- 积分:1
-
插入排序
说明: 根据所选定的字符顺序,按照从大到小的规则,对字符进行插入排序,(Insert and sort characters)
- 2020-06-22 12:40:01下载
- 积分:1