network routing configuration books

网站设计方法，用MVC模式来构建，实现了方法的独立性和数据逻辑的保护-website design method used to build MVC model, the method of achieving independence and the logic of data protection

电子工业出版社的，详细介绍windows环境和dos环境下的串口通信基本方法等-The Publishing House of Electronics Industry, detailing windows and dos environment basic methods of serial communication

本书是电子通信类的研究生教材。-This book is kind of electronic communications post-graduate teaching.

图论中最小生成树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]

JSP初学大全!!带连接数据库例子,里面有很多初学的例子,可以给初学者和大的帮助-JSP beginner Guinness!! Belt connecting the database example, there are many examples of learning, can help beginners and

MAX262是一款可程控滤波芯片,该是它的英文数据手册.-MAX262 is a programmable filter chip, which is its data sheet in English.

CONVERSOR BCD TO 7 SEGMENTS DISPLAY

Vc++的MFC的PDF教 程-Vc MFC PDF Guide

cpp codes for zju.edu.cn problems-cpp codes for zju.edu.cn problems

minigui的白皮书，里面的内容相当的详细，大家可以下载-minigui White Paper, which is quite detailed, everyone can download