4317973

实现网店工呢 ,留言，注册 及后台管理功能 购物车 ..等等 你下了自己看吧mysql 数据库 里面已经有数据库-HOLL THIS GOOD HI HI FDF FDF

数据结构中常用的Gauss-Seidel 迭代算法-commonly used data structures, the Gauss- Seidel iterative algorithm

vb实现的排序算法演示vb实现的排序算法演示.冒泡、选择、折半等多种排序算法(vb sort demodemodemodemodemovb sort demodemodemodemodemo)

一个教师信息管理的Visual Basic源码-a teacher information management Visual Basic source

贪心算法实现汽车加油问题贪心算法实现汽车加油问题(Greedy algorithm greedy algorithm automobile refueling vehicle refueling)

数据结构课件，清华大学版，与大家分享，感谢作者。(data structure courseware, Qinghua University edition share with you, thanks to the author.)

离散事件模拟程序，以及自定义数据类型的队列实现-Discrete event simulation program, as well as custom data types of queues to achieve

用C++制作家谱-C production records

约瑟夫环，数据结构算法，挺有意思，看看，看看(ysphdfgfgf)

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.