▍1. yongzhanshixianleicaozuo
自己做的一个用用栈实现类的操作,是课内作业,希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)
自己做的一个用用栈实现类的操作,是课内作业,希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)
采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)
另外一个可以实现线性表的程序,简单的操作,值得初学者的借鉴(Another table can achieve a linear process, simple to operate, it is worth drawing beginners)
就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)
floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)
利用双向链表实现对两大整数的相加运算。 可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)
一个简单的停车场管理程序,是初级学习数据结构时的一个十分重要的实验,了解这个对学习堆栈十分有用,基本题目是 设有一个可以停放[size=10.5pt]N[size=10.5pt]辆汽车的狭长的停车场,[size=10.5pt] [size=10.5pt]它们有一个大门可以供车辆进出。车辆按到达停车场时间的先后次序从停车场最里面向门口处停放(最先到达的第一辆车停在停车场的最里面)。如果停车场已放满[size=10.5pt]N[size=10.5pt]辆车,则后来的车辆只能在停车场大门外的便道上等待,一旦停车场内有车开走,则排在便道上的第一辆车就可进入停车场。停车场内如果有某辆车要开走,在它之后进入停车场的车辆都必须先退出停车场为它让路,待其开出停车场后,这些车辆再依原来的次序进入。每辆车在离开停车场时,根据它在停车场内停留时间的长短交费。如果停在便道上的车辆未进入停车场就要离去,允许其离去时不收停车费,并且仍然保持在便道上等待的车辆的次序()
dijkstra算法,用于寻找已建立图的最短路径,是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)
本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)
根据最常用的链表法进行huffman编码,可以手工预制权重,例如n=8的时候即可以在文件中写入,输出相应的编码结果(According to the most commonly used method of Chain Huffman coding, manual can be prefabricated weight, For example, n = 8 when it is written in the document, the output corresponding to the coding results)
带权有向以及无向图的各种操作,适合数据结构初学者使用,是图那一章的重点(belt and the right to have no plans to the various operations, data structure suitable for beginners, is the chief focus of the chapter)
Huffman编码与译码,实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)
链表L,创建公有成员函数Split(A,B ),创建2个新表A,B,使的A 中含有L中奇数位置元数,B中含L偶数位置元数 (Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)
包括链表的各项操作,添加、删除、修改等。还包括单项连标和双向链表。(including the operation, add, delete, revise. Also including individual targets and even two-way linked list.)
工作时单元功能实现的部分资料 主要涉及字符串处理、排序算法,字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)
循环链表的应用 循环链表的应用 很方便的实现(cycle Chain cyclic chain of convenience Implementation)
Devil language 数据结构中的经典问题 此为问题!(Devil language data structure of the classic problems of this problem!)
代码注重B树插入、删除的算法逻辑,适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )
马踏棋盘的贪心算法,8*8棋盘,基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)