个人珍藏，初学java很好的教材！这是第9章的电子书和源码，后面我陆续传上与大家分享！...

适合C初学者的100个小例子，愿大家能够早日上手-C for the beginners 100 small example, we would like to get started as soon as possible

初学单片机必会40个基本实验,让你单片机轻松入门-Single-chip will be learning 40 basic experiment, let you easily single-chip entry

CSharp 2.0编程，内容经典，书中的例子比较详细-CSharp 2.0 programming, as classic examples of the book in more detail

最近比较流行的Java web开发平台，主要介绍了myeclipse6的安装和配置方法。入门学习书籍。-Recent popular Java web development platform, which mainly describes the installation and configuration method myeclipse6. Introduction to study books.

本wap小说系统必须运行于杰奇小说系统上，支持杰奇小说版本：1.25、1.30、1.31、1..40。完美与杰奇系统各种信息接合（用户数据、书签、藏书、积分） 与原书站系统独立，但数据共享。 支持书籍搜索。 支持用户登录； 支持阅读设置； 本系统与原杰奇完全独立，不修改原系统任何代码。-Wap novels of this system must run on杰奇novel systems to support novel杰奇version: 1.25,1.30,1.31,1 .. 40.杰奇system with perfect bonding all kinds of information (user data, bookmarks, books, points) and the original system of independent stations, but data sharing. Support for english books. Support for user login support reading settings the system with the original杰奇completely independent, without modifying the original system of any code.

本电子数为比较经典的《数据结构及其算法集》，作者为高一凡，比较详细的介绍了各种算法。-In order to compare the electronic digital classic

图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]

数字图像处理入门源代码-Digital Image Processing Portal source code

The first two functions are useful for creating a blank image of the specified parameters. A possible use is in functions that require a pointer to a result. The clone function performs an exact copy of the IplImage* parameter-The first two functions are useful for creating a blank image of the specified parameters. A possible use is in functions that require a pointer to a result. The clone function performs an exact copy of the IplImage* parameter

众所周知，JDBC（Java数据库连接）是Java 2企业版的重要组成部分。它是基于SQL层的API。通过把SQL语句嵌入JDBC接口的方法中，用户可以通过Java程序执行几乎所有的数据库操作。JDBC只提供了接口，具体的类的实现要求数据库的设计者完成。通过生成这些接口的实例，即使对于不同的数据库，Java程序也可以正确地执行SQL调用。所以对于程序员来说，不必把注意力放在如何向数据库发送SQL指令，因为程序员需要了解和用到的只是JDBC的接口，只有在极少数情况下会用到面向特定数据库的类，例如程序员希望使用ORACLE的扩展API。-known, JDBC (Java Database Connectivity) is a Java 2 Enterprise Edition of the important components. It is based on SQL API layer. Through JDBC embedded SQL interface method, Java users can implement procedures almost all of the data base. JDBC interface provides only a specific category of demands on the database designer to complete. Interface generated by these examples, even for the different databases, Java programs can also correct implementation of SQL calls. So programmers, we do not have to focus on how to send SQL database directive because programmers need to understand and use the only JDBC interface Only in very rare cases, will use the database for specific categories, For example, programmers hope to expan