资源列表
shortest-path
- 寻找单源最短路径问题的优先队列式分支限界法-Single-source shortest path problem priority queue type branch and bound
01beibao(dongtaiguihua)
- 01背包问题的动态规划算法，能运行，我调好的-01 knapsack problem dynamic programming algorithm, to run, I am a good tune
WORK3X
- 采用顺序映像的方式对队列的相关操作，插入，删除，求其长度，查找头部等-The way by order of queue of eng relevant operation, insert, and delete its length, find head etc
linklist
- 构造一个空链表，销毁链表，将链表置为空表，判断链表是否为空，是返回1，否则返回0，返回链表中元素的个数等功能-Constructs an empty linked list, destroyed linked list, will list the empty table, judge whether the list is empty, is 1, otherwise returns 0 return, return to list the number of elements, and ot
Sqlist
- 线性表的相关操作，构造一个空的线性表，销毁线性表，将线性表置为空表，判断线性表是否为空，是返回1，否则返回0，返回表中元素的个数-Linear list of related operation, constructs an empty linear list, destruction of linear list will be linear table set to empty table, linear list for null judgments, is returns 1, othe
Parking-lot-problems
- 关于停车场停车问题的管理，利用队列的性质就一辆车进停车场后的停车位，停车时间，需交停车费，以及停车场空闲车位的管理等问题-Questions about the management of parking lot, use queue of property is a car into the parking lot after the parking space, stop time, pay parking spot, and free parking management
HuffmanTree
- 这是利用huffman树将数据进行编码，根据huffman树的性质和功能，可以快速有效地查找信息和存储信息-This is used to encode the data huffman tree, according to the nature and function of huffman tree, you can find information quickly and efficiently and store information
01-knapsack-problem--
- 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
data-structure-
- 数据结构中树及二叉树的相关知识，很全面。-Binary tree data structure and related knowledge, very comprehensive.
chuanpipei
- 串的最大匹配算法的新思路，课本上讲解的都是KMP算法-Maximum matching algorithm string of new ideas, textbooks are all on the KMP algorithm to explain
Arithmetic_ex_wangxiaodong(3)
- 王晓东的算法设计与分析教程第三版的课后习题答案-the solutions of Algorithm design and analysis
hhhhy
- 1. 实现循环双链表各种基本运算的算法，完成如下功能： (1) 初始化循环双链表h； (2) 依次采用尾插法插入a, b, c, d, e元素； (3) 输出循环双链表h； (4) 输出循环双链表h长度； (5) 判断循环双链表h是否为空； (6) 输出循环双链表h的第3个元素； (7) 输出元素a的位置； (8) 在第4个元素位置上插入f元素； (9) 输出循环双链表h； (10) 删除h的第3个元素； (11) 输出循环双链表h； (12) 释