-
CMisFpCurd
farpoint控件进行了二次封装,能够快速的帮助进行farpoint操作(The farpoint control is encapsulated twice, which can help the farpoint operation quickly.)
- 2019-04-26 11:43:18下载
- 积分:1
-
gep4j
Googlecode较有代表性得完整代码,可以按照自己需要组合使用。(Google code is more representative and complete code, which can be combined according to its own needs.)
- 2020-06-17 04:20:02下载
- 积分:1
-
采用http协议,获取远程服务器上的文件。很不错哦。
采用http协议,获取远程服务器上的文件。很不错哦。-using http protocol, remote access to files on the server. Oh, very good.
- 2022-05-31 17:29:22下载
- 积分:1
-
Control_Systems_Engineering
A very good ebook on control systems engineering with solution and M-files
- 2010-05-22 21:38:03下载
- 积分:1
-
键盘
说明: 使用Python语言,基于pynput模块开发的,按键记录和重播的简易按键精灵。(Using Python language, based on pynput module development, key recording and replay of the simple key wizard.)
- 2020-06-18 09:28:38下载
- 积分:1
-
蓝牙文件传输,是可以直接运行的一个小程序
蓝牙文件传输,是可以直接运行的一个小程序-Bluetooth file transfer, it can directly run a small program
- 2022-07-08 12:14:34下载
- 积分:1
-
Dynamic_TDMA_Slot_Assignment_in_Ad_Hoc_Networks
一篇adhoc网络实现TDMA的文章,讨论了动态时隙分配的实现与仿真(ADHOC networks realize a TDMA of the article discussed the realization of dynamic slot allocation and simulation)
- 2008-06-06 10:21:58下载
- 积分:1
-
Key-Finder
Key finder for windows....
- 2013-09-09 12:29:38下载
- 积分:1
-
P2P 之 UDP穿透NAT的原理与实现源代码 和文档 设计协议的格式
P2P 之 UDP穿透NAT的原理与实现源代码 和文档 设计协议的格式-P2P penetrate NAT of UDP Principle and realization of the source code and document format design agreement
- 2023-04-14 11:15:03下载
- 积分: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