资源列表
HuffmanTree
- 数据结构——哈夫曼树的生成，有注释，方便各位兄弟姐妹下载阅读。-Data structure- Huffman tree generation, there are notes for you to download brothers and sisters to read.
datastructuremazearithmetic
- 用C实现的数据结构迷宫算法，在Turbo C 环境下可运行出结果，值得借鉴。-With C data structures to achieve the maze algorithm, in the Turbo C environment to run out the results, is worth learning from.
jisuanqi
- 一元稀疏多项式简单计算器设计 数据结构 -One dollar a simple calculator designed Sparse Polynomial data structure
shortest_path
- 分别用floyd 和dijkstra算法计算城市间最短路径的简单例子，地图由固定格式的文件输入，参考压缩包中的sample.txt,地图文件名要作为main参数-Floyd were Dijkstra algorithm and the shortest path between cities in the simple example, the map by a fixed format file input, reference compression package sample.txt,
142
- 编译原理中的递归下降语法分析器写得不好请凉解-Compilation Principle of Recursive dropped poorly written parser please cooler solution
diguisuanfa
- 递归算法的实验报告，内有递归算法的伪代码及C语言实现，以及部分实例~-Experimental report recursive algorithm, recursive algorithm, there are pseudo-code and C language, as well as some examples ~
tree
- 数据结构二叉树算法的应用，VC环境下运行可通过-Binary tree data structure of the application algorithm, VC environment to run through
pai
- 数据结构实验中，纸牌游戏编码，VC环境下运行可通过 -Experimental data structure, the card game coding, VC environment to run through
Queens
- 皇后问题:计算各种情况下的棋盘上皇后的摆放位置-Queen s problems: calculation of a variety of situations on the board the location of Queen s
nQueen
- n皇后问题:计算各种情况下的棋盘上皇后的摆放位置-n Queen s problems: the calculation of a variety of situations on board the location of Queen s
fenzhi
- 通过分支限界的方法，求解1到n的最短路径。设数组a保存图的邻接矩阵，0-9号，共10个节点。节点1为源点，n为目标点.-Through the branch and bound approach for solving 1 to n shortest path. A preservation plan for an array of adjacency matrix ,0-9, a total of 10 nodes. Node 1 is the source, n for the target
Dijkstra
- Dijkstra算法源码，图论中求解最短路径-Dijkstra algorithm source, graph theory for solving the shortest path