-
snake
用C++实现的贪吃蛇游戏程序，对游戏的设计思路有比较详细的讲解。(no )
- 2009-09-04 21:13:30下载
- 积分：1
-
hz
说明： 自制的简单计算器。可供初级VB学者参考和分享( ............\Form1.frm
............\工程1.vbp
............\工程1.vbw)
- 2012-03-26 09:17:06下载
- 积分：1
-
sweitter-bit
A model that changes the effect of the program()
- 2017-11-08 21:50:12下载
- 积分：1
-
2
说明： 魔王语言解释
具体要求参见《数据结构题集》P97,实习2.2中的描述。
用下述两条具体规则和上述规则形式（2）实现。设大写字母表示魔王语言的词汇；小写字母表示人的语言词汇；希腊字母表示可以用大写字母或小写字母代换的变量。魔王语言可含人的词汇。
（1）B->tAdA
（2）A->sae
(Beelzebub language to explain the specific requirements see the " Data Structure set title" P97, internship 2.2 description. 2 with the following specific rules and these rules form (2) implementation. Located in capital letters devil language vocabulary lowercase letters were the language vocabulary the Greek letters can be uppercase letters or lowercase letters substitution variables. Beelzebub language may contain human vocabulary. (1) B-> tAdA (2) A-> sae)
- 2009-10-03 20:09:38下载
- 积分：1
-
rtqhreh4
画图选定,支持直线,矩形,正方形,园等画图,支持单个或多个对象的选定,拖动等,()
- 2017-09-24 20:43:59下载
- 积分：1
-
TrainFinalVersion
这个程序是用堆栈来对火车排序的，该火车的车厢是乱的，经过排序后，火车的车厢变为顺序的，特点是使用VC编写的(This procedure is used to sort the stack to the train, the train is inside the chaos, after sorting, the train carriages into the order, characterized by the use of VC prepared)
- 2009-06-03 11:50:07下载
- 积分：1
-
curve_fitting_ceres_fortest
使用ceres对曲线进行拟合程序，ceres可以从github下载；(Using ceres fitting program, Ceres can be downloaded github )
- 2017-04-22 22:39:27下载
- 积分：1
-
TargetCascading
目标级联法的一种分解方法及它的求解程序。(An objective decomposition method and its cascading solver.)
- 2014-07-01 09:29:46下载
- 积分：1
-
lith
说明： The program of generating static library lib with vc is helpful for learning how to generate lib.
- 2018-12-24 06:49:27下载
- 积分：1
-
youxiangtu
编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路：
（1）如果为n阶，则随机产生一个n*n的邻接矩阵；
（2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。
这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)
- 2008-06-14 02:33:57下载
- 积分：1
