▍1. hashtable102
哈希表实现源码,在VS2005环境下编译。使用了模板。(Hash table to achieve source in VS2005 compiler environment. The use of templates.)
哈希表实现源码,在VS2005环境下编译。使用了模板。(Hash table to achieve source in VS2005 compiler environment. The use of templates.)
使用深度优先遍历最小路径树,根源是 A (Using depth-first traversal minimum path tree but root is A )
这说我精心收藏的一个求表达式值的5种方法源代码,对学习数据结构的人可能会有帮助!(It said that I carefully seek the expression of a collection of five kinds of methods the value of source code, data structure for learning may be helpful!)
将一组数组转换为哈夫曼编码,使用数据结构中的二叉树功能实现(Convert an array to Haffman code)
数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
1>实现可以随意浏览任一景点的介绍。(功能一) 2>可以给出任意两个景点的最短距离及其路线。(功能二) 3>可以查看任一景点热度,并可以对对所有景点热度(访问次数)进行排序。(功能三) 4>每个景点相关内容从文件读取,实现对文件操作的练习。 (1> implementations can feel free to browse introduce 任一景 points. (Function a) 2> You can give the shortest distance and route between any two attractions. (Function b) 3> You can view Renyi Jing point heat, and heat can all attractions (visits) to be sorted. (Function c) 4> each spot related content file reading, to achieve the file operations exercises.)
二叉树的打包数据结构,包括遍历,删除,添加,注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)
在一个N*N的棋盘上指点任意一点的坐标,以马走日的方式走完整个棋盘且没有重复,试分别用DFS、BFS方法求解并输出全部可能的路径。(knight tour problem solved by the method of BFS and DFS.)
算法导论的英文版,讲解算法的非常经典的书。(English version of Introduction to Algorithm. A classical book to teach algorithm.)
中国大学MOOC-陈越、何钦铭-数据结构 解题报告—06-3 六度空间 (Chinese University MOOC- Chen Yue, He Qinming- data structure Solving report of the problem- 06-3 Six degrees space)
C++中,对链表的增删改查的基本使用,值得学习(C++, on the list of CRUD basic use, it is worth learning)
KD树算法,能够实现对点云数据进行压缩,非常简单,适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)
对栈、队列、链表、图、树、查找、排序、顺序表等基本功能的实现(Realization of the basic functions of the stack queue list tree search sort order list)
使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率,并据此构造Huffman树,编制Huffman 码;根据已经得到的编码,对01形式的编码段进行译码。 具体的要求: 1.将给定字符文件编码,生成编码,输出每个字符出现的次数和编码; 2.将给定编码文件译码,生成字符,输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)
校园导航系统包含佛山科技学院本部校区的校园景点平面图。通过系统的各功能不仅可以查询任意景点的编号,名称,简介等信息,还可以查询任意两景点间的最短路径及长度和所有路径及长度。另外,还可以通过一系列操作增加,更改或删除任意的景点的各信息。(Contains the campus attractions plan of the campus Foshan Institute of Technology campus navigation system. Through the function of the system not only can query any spots number, name, profile and other information, can also query the shortest path and arbitrary length between two spots and all paths and the length of. In addition, can also increase through a series of operations, the information change or delete any of the attractions.)
使用两个栈实现队列的操作,有进站出站等操作(Queue With Two Stacks)
已知线性表中的元素以值递增有序排列,并以单链表作存储结构。试写一高效的算法,删除表中所有值大于mink且小于maxk的元素(若表中存在这样的元素)同时释放被删结点空间,并分析你的算法的时间复杂度(注意:mink和maxk是给定的两个参变量,它们的值可以和表中的元素相同,也可以不同)。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values and elements in the table can be the same or different).)