-
VC++高级特效界面一百例 VC++080719
VC++高级特效界面一百例,对做VC++界面GUI的有很好的参考作用(VC++ 100 cases of high-level interface effects, and to do VC++ The GUI interface has a very good reference)
- 2020-06-26 01:40:02下载
- 积分:1
-
netcommunity
说明: Socket是建立网络连接时使用的。在连接成功时,应用程序两端都会产生一个Socket实例,操作这个实例,完成所需的会话。(Socket is used when a network connection. The connection is successful, the application will have a Socket instance ends, the operation of this example, the completion of the required sessions.)
- 2010-04-02 11:29:45下载
- 积分:1
-
average
average of numbers that implements with C# in visual basic. i wrote it
- 2015-07-28 02:39:10下载
- 积分:1
-
egui
一个图形处理库,很不错。开发工具ms vc++ .比较适合开发widget程序界面(this is good gui lib)
- 2010-01-11 13:17:38下载
- 积分:1
-
if_ioctl
在Linux下获取本地ip 网关,dns服务器等数据(Get local ip gateway data under Linux)
- 2012-10-05 11:02:53下载
- 积分:1
-
resiveDlg
c++聊天软件客户端代码,可以实现和双方互相聊天,必须客户端后启动(c++ chat software client code)
- 2013-08-11 19:10:03下载
- 积分:1
-
CDNS_demo
说明: DNS解析系统,通过发送DNS协议包到DNS服务器来获取DNS(DNS analysis system, the agreement by sending a DNS packet to the DNS server to obtain the DNS)
- 2021-01-23 21:48:39下载
- 积分:1
-
STM32F407_ov2640图像处理
stm32f407,寻黑线,控制电机,探索者,智能摄像识别,二值化(Stm32f407, black line, control motor, explorer, intelligent camera recognition, two valued)
- 2020-11-04 08:09:51下载
- 积分:1
-
BounceBallDemo
新手可以学习的桌面小球,用c语言,在vc下可以运行(Novices can learn desktop pellets, using c language, can run in vc)
- 2014-04-13 23:12:11下载
- 积分:1
-
EULER1
说明: Euler 回路问题
.问题描述:
对于给定的图G 和G 中的2 个顶点v 和w,连接顶点v 和w 且经过图中每条边恰好1 次
的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。
.编程任务:
对于给定的图G,编程计算图G 的一条Euler 回路。
.数据输入:
由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m,表示给定的图G 有n 个
顶点和m 条边,顶点编号为1,2,…,n。接下来的m 行中,每行有2 个正整数u,v ,表示
图G 的一条边(u,v) 。
.结果输出:
将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路,则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)
- 2006-03-29 21:31:15下载
- 积分:1