资源列表
gty
- 编写一个程序实现堆排序过程,并输出{6,8,7,9,0,1,3,2,4,5}的排序过程-Sorting process to write a program to heap sort process, and output {6,8,7,9,0,1,3,2,4,5}
cc
- 全排列 字典序 生成 算法 实现-The whole arranged in the lexicographical generation algorithm
0-1
- 0-1 背包问题-动态规划法,算法设计课程作业-0-1 knapsack problem- dynamic programming, algorithm design course work
0-1cc
- 0-1背包问题-分支限界法,算法设计课程作业-0-1 knapsack problem- branch and bound algorithm design course work
0-1hs
- 0-1背包问题-回溯法,算法设计课程作业-0-1 knapsack problem- Backtracking algorithm design course work
zz
- 旅行售货商问题,算法 设计 课程作业-Travel VENDOR problem, algorithm design course work
xx
- 线性规划-解方程组问题,算法 设计课 程作业,能运行成功-Linear programming- solution of equations, algorithm design course work, be able to run successfully
cc
- 近似顶点覆盖,算法 设计课 程作业,能运行成功-Approximate vertex cover algorithm design course work, be able to run successfully
cc
- 线性规划,算法 设计课 程作业,能运行成功-Linear programming, algorithm design course work, be able to run successfully
the-shortest-way
- 求图中由用户指定的开始点与目标点的最短路径并将路径节点和长度进行输出-calculate the shortest distance between the start and the end
puzzle
- 迷宫问题广度优先搜索,本程序针对迷宫问题,采用广度优先策略惊醒搜索,如能到达,输出路径长度,否则输出-1表示不可到达-Breadth-first search of the maze problem
code
- 建立一个空的单链表 建立一个空的链式队列-Singly linked list creates an empty creates an empty chain queue
