资源列表
ComputingforNumericalMethodsUsingVisualC
- 基于c++的各种算法，能是你在较短时间内掌握编程的精髓-Computing+for+Numerical+Methods+Using+Visual+C++
knight
- 骑士漫游的改进算法，回溯算法加贪心选择策略，n最大可以到128-Knight improved roaming algorithms, backtracking algorithms greedy selection strategy increases, n the greatest can go to 128
Google_PageRank_CN
- Google排序算法介绍的中文版，适合seo研究和学习-The Chinese version of Google Page Rank Algorithm for reserch & study in SEO
shujujiegou
- 数据结构大型作业 包括三个实验 图的建立 城市最小生成树 赫夫曼书 有文档跟编译调试的代码 hubeiminyuan-Data structure diagram of large operations include the establishment of three pilot cities in the minimum spanning tree Huffman book has to compile a document with the code for debugging
cPlusPlus
- 这是一本不错的书。 为C++经典算法。-C++ manual book
MultiSort
- 双线程对一系列随机数进行归并排序，使用MFC的控制台程序-Dual-threaded on a series of random numbers to merge sort, using the Console application in MFC
queen
- 八皇后问题串行算法,可递推n皇后问题 C代码-eight queen question code
tree
- a code which can constitute a number from keybord to a tr-a code which can constitute a number from keybord to a tree
creatgraph
- 图的建立和图的广度深度优先遍历（有向图和无向图）-Map creation and map the breadth of depth-first traversal (with the map and undirected graph)
maopaopaixu
- 冒泡法排序C++实现的简便运算，可直接应用-Bubble sort C++ method to achieve an easy operation, can be applied directly
erchashubianli
- 二叉树遍历 包括先序遍历 中序遍历 后序遍历 求结点个数 求树的深度-Including the first order binary tree traversal traversal sequence in order to postorder traversal node number and ask for the depth of
stack
- 表达式求值是程序设计语言编译中的一个最基本问题，它的实现是栈的应用的典型例子。-Expression evaluation is a programming language compiler in a fundamental question, and its implementation is a typical example of the application stack.