▍1. jing_dian_bian_cheng
一些常用的c语言算法,有900多道源码,包括常见的指针 数组 文件的操作(Some commonly used algorithm c language, has more than 900 Road source, including the common file pointer array operation)
一些常用的c语言算法,有900多道源码,包括常见的指针 数组 文件的操作(Some commonly used algorithm c language, has more than 900 Road source, including the common file pointer array operation)
一个简单的停车场管理程序,是初级学习数据结构时的一个十分重要的实验,了解这个对学习堆栈十分有用,基本题目是 设有一个可以停放[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)
和线性表类似,栈也有两种存储表示:顺序栈和链栈。 顺序存储结构简称为顺序栈。和顺序表类似,对顺序栈也需要事先为它分配一个可以容纳最多元素的存储空间。 (and linear scale similar Stack also have two storage : order Stack and Stack chain. Sequence storage structure referred to as the sequence of stack. Table and order similar to the order Stack also needs prior to allocate it can accommodate a maximum of elements of storage space.)
Huffman编码与译码,实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)
很好的求解骑士迷宫的的代码,可以在vc6.0环境下运行的c语言代码(good for the Knights maze of code can run under vc6.0 the c language code)
链表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.)
严蔚敏老师的数据结构题集答案(C语言版)(Yan Wei Min teachers collect data structure that answers (C language version))
某学校的数据结构的复习题,希望对大家有用。(a school in the review of the data structure, and expressed hope that it may be useful right.)
c语言链表,需要的时候可以方便大家使用,仅供参考(c language, and when required, we can easily use for reference purposes only)
c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示(c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table)
c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示(c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table)
工作时单元功能实现的部分资料 主要涉及字符串处理、排序算法,字符串查询、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)