在乌尔都语书地址

基于Boost.Asio实现的HTTP客户端开发工具库, 它支持HTTP(1.0/1.1)、HTTPS，断点续传，多线程并发下载，异步，HTTP/SOCKS4/SOCKS5代理支持等特性，开发者可以轻松的基于这个库开发其他相关应用。

关于avltree的源码，大家可以学习一下了-On the source avltree, everyone can learn about the

通过广度优先算法，遍历网络中的每个结点，得到遍历结点的时间-Through breadth-first algorithm, network traversal each node, the node traversal time

添加菜单，演示的是一个颜色菜单的添加-add menu is a demonstration of the menu to add color

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

This is my first program, It doesn t do anything.

介绍windows图形编程的基础知识和一些常用方法-Windows graphics programming introduce basic knowledge and some common methods

互斥量的类封装，适合C++编程，通过此类，能够直接对互斥量进行控制。-Mutex class package for C++ programming, through such direct-to-mutex control.

This macro examines the character at the cursor. If it is any of the 4 characters (){} it tries to find the matching character. For C programs it correctly handles comments, and string and character constants.

本代码基本实现班级学生花名册的管理，包括学生信息的增加、删除、修改、查询，运用结构体存储学生的基本信息，包括姓名、年龄、成绩等，是C基础的应用