资源列表
01
- c++利用回溯法来实现01背包问题 阶段是:在前N件物品中,选取若干件物品放入背包中; 状态是:在前N件物品中,选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值; 决策是:第N件物品放或者不放; -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of items into the backpack status
zhognshuwenti
- 这是我用c++编写的一个种树问题的程序,而且该程序我已经调试通过,希望对大家有帮助-This is because I use c++ written in a question of planting process, but I have to debug the program passed, want to help everyone
Map_SYSU
- 这是一个使用图数据结构实现的中山大学地图程序,里面有一文档说明了程序的用法及测试。-this is a use of graph data structure to realize map of sun yat-sen university program, there is a document illustrates the use of the program and test.
btree
- 二叉树源码,通过链表实现。有意向者可以-Binary source
Count_words
- 使用 树形结构 编写的应用于单词字符数量统计代码-Use tree structure to write used in word character quantity statistics code
average
- 一个计算平均分数,应用好的算法,提供了运行速率-get the average of some numbers with a good algorithm
bahuanghou
- 最简单的、传统的八皇后问题,利用了C++中的栈结构-This is the most simple one.There are program designs of eight queens chess problem.
duanyuanlujin
- 计算机算法分析师习题,单源最短路径问题,使用的是贪心选择算法实现,通过调试,c言语实现-The the computer algorithms analyst exercises, single source shortest path problem, use greedy selection algorithm implementation, through debugging, c speech achieve
lianbiao
- 数据结构经典实验 关于链表的实现 环境Visual C-Data structure of a classic experiment on the list to achieve environmental Visual C++
eight-queen
- 八皇后问题19世纪著名的数学家高斯于1850年提出的。他的问题是:在8*8的棋盘上放置8个皇后,使其不能互相攻击,即任意两个皇后都不能处于同一行、同一列、同一斜线上。请设计算法打印所有可能的摆放方法。-8 queens problems in the 19 th century famous mathematician gauss put forward in 1850. His problem is: in 8* 8 board placed eight queen, to make it c
xianxingbiao
- 数据结构中线性表的c++实现,包括经典问题约瑟夫环。-Linear table data structures c++ implementation, including the classic problem Josephus.
zuiduanlujing
- 单源点最短路径课程设计,有完整注释,初学者适用-Single-source shortest path curriculum design, the entire project