资源列表
jiandandaoyou
- Introduce：地点介绍函数。 Shortestdistance：计算两地的最短距离。 Floyed：floyed算法求两地的最短距离。 Display：打印两个地点的路径及最短距离至屏幕。 Main：总体控制各函数并提供原始数据。 -Introduce: site presents the function. Shortestdistance: the shortest distance between calculation. Floyed: Flo
C
- C语言的一些算法,和一些编程规范，供学习参考-C yuyan de yixie suan fa guan yu bian xie xi guanC yuyan de yixie suan fa guan yu bian xie xi guan
0-1beibaowenti(fenzhijiexiansuanfa)
- 本程序采用分支界限算法解决经典的0-1背包问题。-This program uses the branch and bound algorithm to solve the classical 0-1 knapsack problem.
deletenode
- 删除链表中的结点！我写的一个高级删除法，操作十分简便-delete the node of link！
nqueens
- 深度优先N皇后算法~输入文件形式，可运行代码，开发环境vs2010-Depth-first N-Queens algorithm ~ form of the input file, you can run code development environment vs2010
Data.Structures.and.Algorithms.in.C
- [数据结构与算法C..版].很不错的一本数据姐都与算法书籍哦，需要的可以-Data structure and algorithm C. Edition ]. A very good data sister books and algorithms Oh, need to be down
DXS
- 若不存在一元多项式，输入m项系数的指数，建立一元多项式，销毁一元多项式，两个一元多项式相加，保存一元多项式-If there is a polynomial input m coefficient index, the establishment of a polynomial, and the destruction of a polynomial, and two unary polynomials, and save a polynomial
maze
- 输入迷宫的行数，不大于20，输入迷宫的列数，不大于20，随机建立迷宫，输入入口坐标和出口坐标，找出走出迷宫的路径-Enter the maze the number of rows is not greater than 20, enter the number of columns in the maze, not more than 20 randomly create the maze, and enter the entrance coordinates and export coord
vbpaixu
- 排序算法 三种基本的排序 快排 冒泡 选择-
CreateGraphDemo
- 该源码实现了四种基本图的创建，是学习数据结构是必定要涉猎的部分，本程序是C语言编写-This source realize the four basic graph created, is the study data structure is bound to dabbled in part, this procedure is written in C language
CreateGraph
- 本程序实现了数据结构中图的基本创建方法...以及图的深度遍历和图的广度遍历-This program to achieve data structure of Chinese basic and establish ways... And the depth of the graph traversal graph and breadth of traverse, etc...
s
- 数据结构的各种算法，有利于理解算法的构造和运用，有利于学习编程-Data structure algorithms, it is helpful to understand the algorithm structure and use, conducive to learning program