Accounts management software: financial accounts for the specific management

通 配 符的 删除的 C 语言源码 -wildcards to the deletion of the C language source code

windows main class function 实例2-windows main class function Example 2

键盘输入不定长（最大长度受限制）二进制数，以回车键结束，输入数据要求有容错功能，然后将其转换成十六进制数显示输出。-Keyboard input variable length (maximum length) binary number to the end of the enter key, the input data required fault tolerance, and then converted to hexadecimal number display.

HTML Edit is sample for visual Basic

这本书主要介绍支持高级计算机程序设计和算法分析的数学。-This book introduces the support of senior computer program design and analysis of mathematical algorithms.

压缩包包含两个文件ProcessManager.h、ProcessManager.cpp可以直接使用 CProcessManager提供接口如下： BOOL   SetProcessId(DWORD dwProcessId); BOOL   EnableDebugPrivilege(); BOOL   QueryProcessStatus

一个简单的C++文件生成器，根据定义，生成良好的格式C++头文件和实现文件，包含缺省构造，拷贝构造等等。-A simple C++ Document generator, by definition, generate a good format C++ Header file and the realization of a document that contains the default configuration, copy-constructor and so on.

一个完全用的是C#编写的计算机照片的查看器，能够放大照片，而且照片的放大时其他不能够比的，能够放大你想要的倍数。

这种软用于从图像生成图标。它包含了源代码和构建版本instalable。净框架3.5

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.