WIN32程序员参考大全(一)――窗口管理和图形设备接口 已经绝版的书~~ 学习api最全的书 使用超星阅读...

原作者： 这是我学数据结构编写的算法，我把他整理出来，都是基本算法，供大家学习。我使用c++面向对象形式编写，各种算法都封装在各自的类里，如果想增加功能，在相应的类里增加函数即可。我对树和图的构造也做了一些人性化设计，输入更加形象化，你可能看不懂，没关系漫漫来。各种类都使用模版设计，可以对各种数据类型操作（整形，字符，浮点）-Original author: This is my data structure of the algorithm, I regard him finishing out of the basic algorithm is for them to learn. I use c++ Prepared in the form of object-oriented, all kinds of algorithms are encapsulated in their respective classes, if you want to increase functionality, in the corresponding category can increase function. I map the structure of trees and have done some human design, the importation of more figurative, you may not understand, does not matter for long. Use various types of templates designed to operate on various data types (plastic, characters, floating-point)

c语言编写的平面刚架静力分析主程序-c语言 ?嘈

PHP4快速入门-PHP4 Quick Start

关于python的简明教程，更注重python基础性的语法和知识，格式为chm，给有需要的人-Concise tutorial on the python, python will pay more attention to basic grammar and knowledge, format chm, to those in need

VISUAL C++与MATLAB实现混合编程源代码-VISUAL C++ Realize mixed language programming with the MATLAB source code

Borland c++ bulder的文件操作总结-Borland c bulder document summing up operation

介绍常用的简单滤波算法 -A simple filter algorithm commonly used in

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

绝顶高手的编程思想-tiptop experts in the program thinking

turbity measurement using rgb sensor