通信录

罗马支配数的算法，对广义Petersen图P(n,2)的罗马支配数进行了研究-Rome dominated the number of algorithms, on the generalized Petersen graph P (n, 2) the number of Roman domination of the research

解决约瑟夫问题，运行过了，保证可以。问题是清华严蔚敏版本的《数据结构》书-Joseph problems to solve, run-off, and guarantee. The problem is Tsinghua Yan Wei-min version of the " Data Structure" book

一套采用php+mysql数据库方式运行的多用户网上商城系统，具有安全、负载量高，访问迅捷的特点，能与论坛、博客、CMS等系统整合并支持一站登陆。系统内置贝宝、支付宝、快钱等在线支付网关以及QQ、旺旺、雅虎通即时网络通讯工具.-Adopted a set of php+ Mysql database running multi-user online mall system with safe, high-load, quick visit to the features with forums, blog, CMS, such as systems integration and support the one-stop landing. PayPal embedded system, AliPay, quick money, such as online payment gateways, as well as QQ, Wangwang, Instant Messenger network communication tools.

这是数据结构第四章中串的全部算法代码，实现了全部算法，对学习数据结构的同学很有帮助-this is a code of data structure

关于这段代码我没有呼唤你在学生信息系统写使用 MS 访问我还精通 MS Access 数据库的发展，但我我还在学习。此应用程序的密码是： iveymae。该系统还将生成为学校学生的出勤报告。

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.

基于VISAUL C++开发的 关键路径求解 属于数据结构-Based on VISAUL C++ Developed to solve the critical path data structure belonging to

jdbc连接db2范例,非常完整,我找了很久,供学习参考-jdbc connecting db2 example, the very integrity, I look for a long time for study reference

Delphi编程练习：在数据库中以文件流形式保存JPEG图片。-Delphi Programming practice: in the database in order to document the form of preservation of JPEG image stream.

C++数据结构图结构的类定义及有关算法-C data structure definition of the class structure and the algorithm