a good Attendance Management System

三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)

图论经典算法，包括最短路径，最小生成树，强联通分支等-Classical graph theory algorithms, including shortest path, minimum spanning tree, strong branch of China Unicom, etc.

vc源代码 11.1编程测试顺序容器矢量（vector）的主要功能和使用方法 -11.1 programming source code vc test vector sequence containers (vector) of the main functions and use

不错的代码 希望大家喜欢 别忘了看完以后联系我 -good code hope you like do not forget to contact me after reading

Complex VB OPC Automation Example

实现构造哈夫曼树的哈夫曼算法。 求解出所构造的哈夫曼 使用树的带权路径长度。 -Huffman tree structure to achieve the Huffman algorithm. Solving the structure of the Huffman tree with the right to use the path length.

ｃ＃语言快速入门基础代码带注释，主要是针对那些对C#想快速入门的人并且有一定的C++基础的人提供的，快如懂得C#的基本语句和面向对象的基本思想。

求最大公约数和最小公倍数的程序，输入两个数，能求出最大公约数和最小公倍数-seek common denominator and implements procedures to import two few, the common denominator can be obtained and implements

利用VB通过串口控制单片机读写24C02源代码程序-The use of VB to read and write through the 24C02 single-chip serial port control program source code

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output