登录
首页 » Visual C++ » C语言图形编程

C语言图形编程

于 2017-11-10 发布 文件大小:43KB
0 180
下载积分: 1 下载次数: 1

代码说明:

  C语言 关于图形编程的 一些方法函数以及相关使用方法。(C language graphics programming on some methods, functions and related methods of use.)

文件列表:

C语言图形编程.doc

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • DrawSgy
    读取IBM数据类型sgy文件,转换换为IEEE类型数据文件;然后绘制读取的sgy数据。含有测试数据。(Read IBM data type sgy file types convert to IEEE data file then read sgy draw data. With test data.)
    2010-07-11 14:03:57下载
    积分:1
  • LOF
    列举制定的目录中被打开的文件,和打开这些文件的进程的PID,命令:lof 驱动文件 目标文件夹。由于驱动的限制,该程序仅适用Windows 2000/XP。(Listed in the directory has been developed to open the file, and open the files of the process PID, the command: lof driver file destination folder. As the driving restrictions, the program applies only to Windows 2000/XP.)
    2010-03-13 22:36:30下载
    积分:1
  • DatabaseTest
    关于ADO数据库添加的一个简单例程,使用MFC的对话框为平台。(use visual C++ a sample about how to create ADO database . and the project is dialog on MFC)
    2013-03-16 21:23:53下载
    积分:1
  • vcPPtoDAO
    visual c++ 访问DAO数据库 运行目录,驱动器根目录下(visit DAO datebase)
    2014-04-14 13:02:06下载
    积分:1
  • button698
    此软件讲述的button控件的多种使用方法,比如改变颜色,改变字体颜色,背景颜色,样式(This software describes a variety of use of button controls, such as changing color, changing font color, background color, style)
    2017-12-15 14:08: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
  • GshaangqumianP
    GPS导航定位双曲面求解方法,,用了卡尔曼滤波法,改方法实时性高 (GPS navigation and positioning the hyperboloid solving method, using a Kalman filter method, change its method of real-time high)
    2012-09-15 22:26:34下载
    积分:1
  • TracKid
    ollydbg plugin开发工程,已经写好的框架,可用于插件开发。(Ollydbg plugin development engineering, has written a good framework, can be used in plug-in development.)
    2014-10-16 16:57:02下载
    积分:1
  • Expression-evaluation
    bo3-1.cpp 顺序栈(存储结构由c3-1.h定义)的基本操作(9个) algo3-6.cpp 表达式求值(输入、输出和中间结果均只能是0~9)(Bo3-1.cpp order of the stack (storage structure defined by the c3-1.h) basic operations (9) Algo3-6.cpp expression evaluation (input, output, and intermediate results are only 0 to 9))
    2014-02-11 18:14:56下载
    积分:1
  • PL0-The-compiler
    一、完成的实验内容及说明 基本内容 (1)扩充赋值运算:+ 和 - (2)扩充语句 REPEAT <语句序列> DOWHILE <条件> 其中,<条件>是循环条件,即条件成立时,重复执行循环体的< 语句序列> 选做内容 (1)增加运算:++ 和 。 (2)增加类型:① 字符类型; ② 实数类型。 (3)扩充函数:① 有返回值和返回语句;② 有参数函数。 (4)增加一维数组类型 (A, the experiment content and complete The basic content Operation: (1) expand the assignment+ and (2) REPEAT expansion statements < > statement sequence Conditions of DOWHILE < > Among them, the conditions of < > is loop condition, namely conditions founded, repeat the loop body < > statement sequence Choose to do content (1) operation:++ and . (2) types: (1) character types (2) real types. (3) the expansion of function: (1) has a return value and return statement (2) a parameter function. (4) increase a one-dimensional array type)
    2020-07-16 22:38:54下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载