-
< 程序界面编程实例>>
创建分隔应用程序窗体；根据窗体大小排列控件；使用表格定位窗体控件；在菜单栏中添加文本框；在状态栏中添加进度条...
< 程序界面编程实例>>
创建分隔应用程序窗体；根据窗体大小排列控件；使用表格定位窗体控件；在菜单栏中添加文本框；在状态栏中添加进度条-> to create separate application form according to the form resize control use the form on the positioning form controls in the menu bar to add a text box add a progress bar in the status bar
- 2022-02-02 10:55:52下载
- 积分：1
-
直线Bresenham 算法
直线的中点 Bresenham 算法的原理：每次在主位移方向上走一步，另一个方向上走不走步取决于中点偏差判别式的值。
理想直线将平面划分为三个区域：对于直线上的点，F(x, y) = 0; 对于直线上方的点 F(x, y)>0; 对于直线下方的点F(x, y)
- 2023-06-04 13:50:03下载
- 积分：1
-
- 2022-06-02 11:07:28下载
- 积分：1
-
COBF (aka C
COBF (aka C-Obfuscator) is a program which manipulates C or C++ sourcefiles in a way that they aren t readable by human beings but they remain compilable. The benefit of COBF lies in the distribution of programs (freeware, shareware, commercial software etc.): The distribution as a executable binary is often too inflexible (especially for Unix or Windows NT, because it is normally not feasible to support all possible platforms) on the other side one might not give away the sourcecode (e. g. it looks poor [badly commented, Spaghetti code], or you just want to prevent plagiarism). Here COBF can play an important role: It removes all comments and sourcecode formattings and renames all variable and function identifiers. See files.txt for a complete list of the files provided with the cobf zip archive! See doc/ for the COBF manual!
- 2022-07-21 12:34:20下载
- 积分：1
-
我用vc实现的Gouraud算法
我用vc实现的Gouraud算法-achieve shading algorithm
- 2022-08-12 07:46:04下载
- 积分：1
-
rdesktop （远程桌面）
远程桌面服务器和客户端
你的猫使用它来连接到 windows rdp 的服务器。
- 2022-02-21 21:42:49下载
- 积分：1
-
可经纬度坐标的控件
可经纬度坐标的控件-can longitude and latitude coordinates of Control
- 2022-02-03 14:14:09下载
- 积分：1
-
这是用VC++开发的交通灯的应用程序,可以模拟交通灯
这是用VC++开发的交通灯的应用程序,可以模拟交通灯-It is developed by using VC++ application traffic lights, traffic lights can be simulated
- 2022-02-12 00:46:59下载
- 积分：1
-
K r u s k a l算法每次选择n
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.
- 2023-02-08 08:10:04下载
- 积分：1
-
这是一个实现放大镜功能的代码，通过选择工具条上的放大镜按钮然后单击鼠标左健并且拖动就可以放大窗口内的内容。...
这是一个实现放大镜功能的代码，通过选择工具条上的放大镜按钮然后单击鼠标左健并且拖动就可以放大窗口内的内容。-This is a realization of a magnifier function of the code, by selecting the magnifying glass toolbar button then click the left mouse and drag Kin can enlarge the contents of the window.
- 2022-11-01 11:35:03下载
- 积分：1
