资源列表
Dijkstras
- Dijkstas algorithm, that uses prim s algo and primarique, fibonacci, it is done with visual studio 2010
stack
- 数据结构常见抽象数据类型--栈的自定义实现-The custom implementation of common abstract data types--stack in data structure
erchapaixvshu
- 用c语言实现二叉排序树的查询，快速快捷，已实验通过-C language implementation using binary sort tree query, fast speed, have been experiments by
p2_v1
- secondpart. Operation system project. creat son in father. then contact two.
cPPmath
- c++两个算法，自己经过测试，对于初学者有帮助-c++ two algorithms, they are tested, there is help for beginners
4
- 这是一个实现哈夫曼编码的代码，大家看看，参考一下。我觉得这个不错的。-This is a realization of Huffman code, let us look at reference. I think this is good.
huffman
- huffman树，Huffman编码，可以构建最优二叉树，-Huffman
Minimum_spanning_tree
- 最小生成树是一个有 n 个结点的连通图的生成树是原图的极小连通子图，且包含原图中的所有 n 个结点，并且有保持图联通的最少的边。 本程序生成一个最小生成树-Minimum spanning tree is a n-node connected graph of the minimal spanning tree is the original connected subgraph, and contains all the n original nodes, and there are pl
zuiduanlujin
- 利用邻接矩阵构造图，并求出某一顶点到其余顶点的最短路径并打印输出。-Using the adjacency matrix structure maps, and find the rest of the vertices of a vertex to the shortest path and print output.
xueshengxinxiguanli
- 这是用数据结构编写的学生信息系统的综合程序。实现了排序，添加，删除，查询等功能。-This data structure is written the comprehensive student information system programs. To achieve the sort, add, delete, query.
depth_first_search
- JAVA 深度優先搜索實例 JAVA Depath First Search-JAVA depth-first search examples JAVA Depath First Search
56
- 图的深度优先遍历，先用一二维数组存放图的信息，再调用creategrahph函数将其转换为邻接表的形式，接着调用dfs函数对图像进行深度优先遍历。