-
Chat
网络通信客户端程序，利用vc++编程，简单方便，也实用(Network communication client program to use vc++ programming, is simple and convenient, but also practical)
- 2009-04-04 11:34:27下载
- 积分：1
-
3_3_17
说明： c#做的一个计算器,感觉挺不错的..希望大家多多支持(c# done a calculator, I feel pretty good .. hope that we can support)
- 2008-11-22 20:33:57下载
- 积分：1
-
Kline_Original
VC++6.0 MFC for Stock KLine
- 2020-06-25 16:40:02下载
- 积分：1
-
speech
说明： 语音识别系统，是在vc平台编写的，仅供参考(Speech recognition system, for reference only)
- 2009-08-19 19:27:39下载
- 积分：1
-
GuiPreview_Regex
GuiPreview_Regex
BC的VCL控件源码，非常好，值得学习(BC s VCL preview control source, very good, it is worth learning)
- 2015-04-11 14:45:45下载
- 积分：1
-
matlab
受阻力的球体运动轨迹程序，阻力与运动方向相反，满足阻力方程(By the resistance of the ball trajectory program, drag, and opposite to the direction of movement, and to meet the resistance equation)
- 2012-10-25 15:48:04下载
- 积分：1
-
FlowLayoutPalnel
Teechart 动态加载，实现同一界面显示多个图形，适用于实时数据采集显示，自动分屏，经实际测试验证(Teechart dynamic loading to achieve the same interface to display multiple graphs, for real-time data acquisition and display, automatic screen, the real test verification)
- 2016-06-13 12:12:18下载
- 积分：1
-
Facce
face重建程序.cpp，大家随便看看，没有makefile(face reconstruction procedure. cpp, you look around, there is no makefile)
- 2008-12-25 14:00:18下载
- 积分：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
-
src
TI德州仪器提供的C6000系列DSP在超声图像上的应用例子，数字扫描算法DSC的源程序(Texas Instruments TI C6000 DSP application examples on the ultrasound images, digital scanning algorithm DSC source)
- 2012-12-04 21:32:45下载
- 积分：1
