在 PHP 中的学生出勤跟踪系统项目

求无向图连通分支_dfs实现,很好用，希望和大家分享-For undirected graph connectivity _dfs branch to achieve

单链表简单基数排序，关键字有三个，参与排序的关键字的值为0-9之间的数-Simple single-chain base sequencing, there are three keywords to participate in the value of the keyword ranking for a number between 0-9

可以进行简单的S型座位编排！这是一个数据库应用的小程序，可以继续扩展其功能-can conduct a simple S-type seating arrangements! This is a small database application procedures, can continue to expand its functions

ESQL/C Informix C~{7CNJJ>76~}

用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.

一个 福彩3d 彩票程序, 随便下，权当研究彩票。-a FC3D tickets program, every can download it for research use.

本程序是实现对室内电源线及插座的布局 是数据结构中的一个程序-this procedure is right indoor power lines and the socket layout data structure which is a procedure for the

数据结构中最小生成树的C语言实现源代码，需要的可以下载，只适用于初学者。-Minimum spanning tree data structure in the C language source code, need can be downloaded, only applies to beginners.

对文件中的数据进行哈夫曼编码和解码,列出给定数据的权重,列出左右孩子和父亲节点的列表,对任意数据进行进行哈夫曼编码和解码-to document the data Huffman coding and decoding, data presents given weight, shown around children and the father node list of arbitrary data for Huffman coding and decoding

车厢调度----数据结构课程设计。利用的栈的结构进行设计，主要包括栈的基本操作，及进行调度的算法。-Scheduling data structure inside the curriculum design. Use the structure of the stack design, including the basic operation of the stack, and scheduling algorithms.