资源列表
MST
- 最小生成树的几种算法的实现，包括克鲁斯卡尔和Prim算法-Minimum Spanning Tree Algorithms of implementation, including the Kruskal and Prim algorithms
d
- 1． 0-1背包问题 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高 -1. 0-1 knapsack problem at 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. N items from
DataStructure
- 几个常用的数据结构算法：堆栈、链表、二叉树、图等。-Some commonly used data structure algorithms: stack, linked lists, binary tree, map.
floydalgorithm
- 此程序是弗洛伊德算法，实现在图中每一对顶点之间的最段途径-This procedure is Freud algorithm implementation plans at each of the vertices of the segment between the way
prim
- 本源码可供数据结构的初学者借鉴，叫最小生成树prim算法-The source for the data structure from the beginners, called minimum spanning tree algorithm prim
bmp_and_maze
- 从24位真彩色bmp图上读取迷宫数据,然后找出路径,再在图上标出路径-From 24-bit True Color bmp maze map data read on, and then find the path, and then marked on the map path
search_word
- 从字母表2中搜索字母表1中的单词,可以按行,列,斜线进行直线搜索-2 from the alphabet of the english alphabet in one word, can be row, column, diagonal linear search
search_number
- 找一个最小的自然数，使它等于不同的两组三个自然数的三次幂之和，即找最小的x，使得：x=a*a*a+b*b*b+c*c*c = d*d*d+e*e*e+f*f*f 其中，a,b,c,d,e,f都是自然数,a<=b<=c, d<=e<=f [a,b,c]!=[d,e,f] 进一步，是否还存在另外一个自然数满足上述条件，可能的话请输出其结果 -Find a smallest natural number, making it equivalent to the thre
StatisticsNumber
- 读入一个西文文本文件,找出文件中的不同字符,对各个不同字符的出现次数进行统计并输出。注意需要重新设定文本路径-Read the text into a text file with the West to identify the different characters in the document, and the emergence of the different number of characters and output statistics. Attention to the
MathShortestPath
- 数据结构,求迷宫最短路径问题,C++写的-Data structure, a maze for the shortest path problem, using C++
DataStructureWithC
- 基于C语言的数据结构算法描述，包括常用的基础算法，适合初学者使用。-Based on the C language descr iption of the data structure algorithms, including the commonly used basic algorithm, suitable for beginners to use.
sturctdata
- 主要用于计算一元多项式的相加,相减运算(多项式的存储使用的是链表结构)-The main one used to calculate the sum of the polynomial, with minus operator (polynomials are used in the storage list structure)