▍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.)
更多选项
▍2. main
求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)
▍3. InserSigList
单链表的插入。数据结构中的算法小程序。初学者很适用。(Single-linked list insertion. Data structure of algorithm applet. Beginners are applicable.)
▍4. Haffman
将一组数组转换为哈夫曼编码，使用数据结构中的二叉树功能实现(Convert an array to Haffman code)
▍5. mapsearch
数据结构，关键路径问题，设计并实现关键路径的一种应用，采用图的算法(Data structure, critical path problem, using graph algorithm)
▍6. MyGPS
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.)
▍7. Bitree
二叉树的打包数据结构，包括遍历，删除，添加，注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)
▍8. Introduction-to-Algorithms
算法导论的英文版，讲解算法的非常经典的书。(English version of Introduction to Algorithm. A classical book to teach algorithm.)
▍9. Six-degree-space
中国大学MOOC-陈越、何钦铭-数据结构 解题报告—06-3 六度空间 (Chinese University MOOC- Chen Yue, He Qinming- data structure Solving report of the problem- 06-3 Six degrees space)
▍10. listnode
C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)
▍11. MyKD Tree
KD树算法，能够实现对点云数据进行压缩，非常简单，适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)
▍12. Huffman-Tree
使用三叉链表实现的哈夫曼树,统计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.)
▍13. Campus-navigation-system
校园导航系统包含佛山科技学院本部校区的校园景点平面图。通过系统的各功能不仅可以查询任意景点的编号，名称，简介等信息，还可以查询任意两景点间的最短路径及长度和所有路径及长度。另外，还可以通过一系列操作增加，更改或删除任意的景点的各信息。(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.)
▍14. 2.2
已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于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).)
▍15. Phone-book
数据结构课程设计 -电话本（运用了MFC图形化界面）(Curriculum design- the phone book)
▍16. fml
已知二叉树的先序遍历结果，建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)
▍17. zuixiaoshengchengshu
最小生成树C语言程序，提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)
▍18. build_max_heap
最大堆排序算法，C++语言编写,原程序，算法导论(The maximum heap sort algorithm, C++ language)
▍19. Insert-and-delete-binary-sort-tree
用c/c++写的二叉排序树的插入与删除，有兴趣的朋友可以看一下(Insertions and deletions using c/c++ to write binary sort tree)
▍20. pinfanfangwen
设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
本站资源：696524 个
本站会员：103920 个
总计下载：488219 次
今日上传：0 个
- 优秀论文及配套源码 SVM Short-term-Load-Forecasting
- 综合能源优化含储能
- 用遗传算法改进粒子群GA-PSO算法
- 通过粒子群能够很好的解决优化问题 pso
- 天牛群算法 BSO
- 混沌粒子群优化算法
- 2019年中国研究生数学建模竞赛E题
- 智能算法的Matlab仿真程序及教程
- 《MATLAB R2016a神经网络设计与应用28个案例分析》随书代码
- BAS BP论文及代码
- denoising
- Airy 基模高斯光束
- EMS Microgrid
- 2012年全国大学生数学建模竞赛题目--葡萄酒的评价Wines-Evaluation
- GA-bp
- 本人调试的大作业 源程序模型+论文 intelligent_control_modle
- LSTM的例子、单向LSTM、双向LSTM、多层LSTM
- 遗传算法优化BP网络案例
- 通过yalmip平台调用cplex求解器 microgrid Cplex
- 基于lstm算法在MATLAB对短期风速进行预测 LSTM-regression-master
