this program is very good

51aspx源码必读.txt   dianyingyuan.sln   ............AbouForm.cs   ............AbouForm.Designer.cs   ............AbouForm.resx   ............inDebugone.jpg   ....................dianyingyuan.exe   ....................dianyingyuan.pdb   ....................dianyingyuan.vshost.exe   ....................gongfu.jpg   ....................lost10-001-3.txt   ....................lost10-001-4.txt   ....................lost10-001-5.txt   ....................lost12-001-4.txt   ....................lost8-001-3.txt   ....................lost8-001-4.txt   ....................Sava.txt   ....................ShowList.xml   ....................spiderman3.jpg

Mysql5.0的源代码，可以不受系统平台限制，而解决原来使用数据库的软件顺利平移的问题。

这个项目是由 ms access 数据库注册系统组成。该数据库包含用户名、 密码、 名字和姓氏。该代码是在 vb.net 中。

应用背景在Java数据库连接使用 ；  MySQL；NetBeans，注：这里的学生已经创造了在MySQL数据库MySQL root用户名关键技术MySQL connector.jar文件可从网站：wvw.mysql.comNetBeans IDE  ； ；7.5MySQL 5.51

数据结构中的八皇后问题-data structure of the eight Queen"s problems

八数码问题的C++实现，最经典的广度有限算法-eight digital realization of the C and classic algorithms limited breadth

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.

演示一个寻找最短路径的算法。-find a demonstration of the shortest path algorithm.

这个是数据结构经典算法实现，是一些不错的算法-shu ju jie gou jing dian suan fa shi xian

用VC写的一个数据库-Use a database written in VC