1

给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)

数据结构c源代码实现，大概有100个左右，基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)

数组的定义与使用，数组的运算，字符串的输入与输出，冒泡排序(list and array)

键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)

用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)

说明：  读取股票数据文件,C++源程序，非常好用。是学生做毕业设计的源料(Read the Stock Data File)

归并排序,复习排序算法，在不同环境下，寻找时间复杂度最少的排序算法( Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)

kd-树（k维搜索树）是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)

图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)

经典算法巴斯卡三角的简单实现，vs2010编译通过(Simple implementation of the classic algorithm Pascal triangle, vs2010 compiled by)