这是一个IDL，刚到一个二次开发的一个良好接触…

学习C语言最简单易懂入门和全面的一门网上教材，非常适合新手学习和老手全面研究。-Learning C language the most simple and comprehensive entry-one-line teaching materials, very suitable for novices to learn and a comprehensive study of veterans.

Geometric and solid modeling Geometric and solid modeling

protel99的使用方法尽在其中，介绍的比较详细。欢迎下载！-make use of protel99 in which the more detailed introduction. Welcome to download!

uniface 是跨系统跨数据库多平台的开发工具-Uniface is a cross-system-multi-platform database development tools

MSWDNM驱动开发的相关书籍，希望大家支持-MSWDNM driven development related books, I hope you will support

在c环境下的对数据结构进行讲解,包含有例题及答案-date structure in C

应用层次分析法用MATLAB软件做出这道题的程序

C++经典书籍和代码-classic books and C code

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

《深入浅出MFC》第二版源代码，学习MFC的极佳参考资料-" In layman" s language and MFC" the second edition of the source code, an excellent reference to learn MFC