访问数据库

神经网络中的K均值聚类算法II： 1.KMIn为输入数据文本，其中，第一个参数为所要聚类点个数，第二个参数为聚类点的维数,第三个参数为所要求聚类的个数 2.KM2OUT为经过K均值聚类算法II计算后得到的结果-Neural network in K-means clustering algorithm II: 1.KMIn input data for the text, of which the first parameter to be the number of clustering points, the second parameter is the dimension of clustering points, the third parameter for the clustering the number of requests for 2.KM2OUT after K-means clustering algorithm II calculation results

一个很好的考勤管理系统-a good Attendance Management System

POJ1840求一个有5位未知数方程解的个数,hash表的经典应用-POJ1840 seeking a five unknown number of equations, hash table classic application

《数据结构与算法》讲义，第1章 概论。 “十一五”国家级规划教材。张铭，王腾蛟，赵海燕，《数据结构与算法》，高教社，2008. 6。 -Chap1 Overview

数据结构中顺序查找的例子-sequence data structure search examples

数据结构算法，图最短路径-data structure algorithm, the shortest path map

java 数据库 功能强大 效率高 SmallSQL Database is a free DBMS library for the Java(tm) platform. It runs on the Java 2 Platform (JDK 1.4 or later) and implements the JDBC 3.0 API. SmallSQL Database is licensed under the terms of the GNU Lesser General Public Licence (LGPL). A copy of the licence is included in the distribution. Please note that SmallSQL Database is distributed WITHOUT ANY WARRANTY without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Please refer to the licence for details.-java a powerful and efficient database SmallSQL Database is a free DBMS library for the Java (tm) platform. It runs on the Java 2 Platform (JDK 1.4 or later) and implements the JDBC 3.0 API.SmallSQL Database is licensed under the terms of the GNU Lesser GeneralPublic Licence (LGPL). A copy of the licence is included in thedistribution.Please note that SmallSQL Database is distributed WITHOUT ANY WARRANTY without even the implied warranty of MERCHANTAB

《Visual C++.NET数据库开发经典案例解析镜像光盘》随书光盘代码。-visual c++.net

清华大学数据结构习题集答案-QingHua university answer to data structure excise

《数据结构》排序演示系统。实现6种内部排序。包括直接插入排序，希尔排序，冒泡排序，直接选择排序，快速排序，堆排序。。这是我的数据结构课程设计！-"data structure" Sort demonstration system. Six species of achieving internal order. Including direct insertion sort, Hill, in order Bubble Sort, direct selection, in order of Quick Sort, heap sort. . This is my data structure course design!