▍1. 03
说明: 《妙趣横生的算法》第三部分原书附带代码程序,绝对属实(" Algorithm for fun," the third part of the original program with the code, the absolute truth)
说明: 《妙趣横生的算法》第三部分原书附带代码程序,绝对属实(" Algorithm for fun," the third part of the original program with the code, the absolute truth)
说明: 约瑟夫算法,适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)
说明: 八数码 对任意数字序列重新排序 高级散列函数 MFC基础编程(Eight Digital Reorder the sequence of any number Senior hash function MFC based programming)
说明: 线性链表的定义,遍历,查找,删除,排序。(Linear list definition, traversal, search, delete, sort.)
说明: 斐波那契 式子计算,属于算法类的 用于VC6.0++(Fibonacci calculation formulas, algorithms are used to VC6.0++ class)
说明: 数据结构:Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛,如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树,是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)
说明: 由数字1和0组成迷宫,0代表可走路径,程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)
说明: 数据结构基本算法实现。包括栈、二叉树基本运算实现,同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)
说明: 二叉树的演示程序。实现了二叉树和哈弗曼树(Binary tree demo program. Implements a binary tree and the tree Hafu Man)
说明: 拓扑排序 对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。 通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意: ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。 ②若图中存在有向环,则不可能使顶点满足拓扑次序。 ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
说明: 设计济南大学校园平面图,所含的景点不少于10个。以图中顶点表示校内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询,即查询任意两个景点之间的一条最短的简单路径。 选作内容: 求校园的关节点。 提供图中任意景点查询,即求任意两点间的所有路径。 校园导游图的景点和道路的修改扩充功能。 扩充道路信息,如道路类别,沿途景色等级,一直可按客人所需分别查询人行路径或车行路径或观景路径。(Design jinan university campus plan, contains at least 10 spots in each vertex said in scenic spots, deposit attractions at the information such as the code name introduction On the path, deposit path length said related information )
说明: 数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)
说明: 一个实现外部排序的程序,其中gnerate.cpp为产生一个随机的文件,用于被排序。而caculate.cpp为外部排序程序。(A realization of the external sort program, which gnerate.cpp to generate a random file for be sorted. The caculate.cpp external sort program.)
说明: 分别用堆栈和数组的方法实现任何进制的数制转换(Arrays were used to stack and method of implementation of any binary number system conversion )
单链表逆置的源码~提供了源码和源码说明~简单实用,适用于课堂作业程度(Reverse single linked list provides a set of source code source code and source code ~ ~ simple and practical instructions for classroom work degree)
双向链表 清华大学 出版社 《数据结构 C++》 源代码实现(Tsinghua University Press doubly linked list <data structure, C++> source code)
C语言树的简单实现,介绍了树你前序遍历,树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)
数据结构简单的课程设计交通换乘算法,里面有零次换乘与一次换乘(Simple structure, curriculum design data traffic transfer algorithm, which have zero time transfer and a transfer)