-
RS232-ACCESS-DEMO0.0.1
Qt写的RS232串口程序源码,需要者收了吧(RS232 by Qt)
- 2021-01-11 16:38:50下载
- 积分:1
-
iCordSource2
这是一个屏幕录制源代码,可以很清楚地录制计算机屏幕,用VC++编写的(This is a screen recording source code, can clearly record the computer screen, written in VC++.)
- 2020-06-16 10:40:01下载
- 积分:1
-
CATIAsecond_development
CATIA二次开发技术基础含光盘CATIA的二次开发(CATIA second_development of CD)
- 2020-11-08 11:39:47下载
- 积分:1
-
vbprint
一種VB不規則打印技術的探討,可以在VB編程中使用,試試其中的函數。(A kind of irregular printing of VB, VB programmers can use, try one of the function.)
- 2010-05-24 14:32:41下载
- 积分:1
-
DicomDisplay
vtkImageViewer2实现的放大,缩小,window color/window level调整(vtkImageViewer2 achieve zoom in, zoom, window color/window level adjustment)
- 2013-07-13 13:02:54下载
- 积分:1
-
bofangqi
vb编的播放器,充分运用了多种控件,功能强大!(vb series player,full use of a variety of controls,powerful!)
- 2011-11-28 12:35:15下载
- 积分:1
-
vb-com
vb 串口上位机 很简单的一个版本,大家自己扩展功能吧
(com executed on pc,it s a simple version ,easy for expansion)
- 2014-01-10 14:22:05下载
- 积分:1
-
nmo
nmo的c程序,多层
比较简单nmo的c程序,多层
比较简单(nmo)
- 2009-04-03 10:01:12下载
- 积分:1
-
exportMapASPicture
这是一个利用MapObjects2.2+vb6.0开发的一个图片输出程序,功能为:将地图范围的内容作为一个图片保存下来。(use MapObjects2.2+ vb6.0 development of an export procedures Photo , functions : to map the scope of the content as a picture preservation.)
- 2020-06-29 14:00:02下载
- 积分: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