登录
首页 » Visual C++ » MM1

MM1

于 2020-11-16 发布 文件大小:2KB
0 270
下载积分: 1 下载次数: 13

代码说明:

  c语言,mm1,排队论模型。c语言,mm1,排队论模型。(c language, mm1, queuing theory models. c language, mm1, queuing theory models.)

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

发表评论

0 个回复

  • 12864TUPIAN
    12864的显示图片和任意文字的函数,能够很好的让初学者入门(12864 pictures and any text display function, can be a good start for beginners)
    2013-09-03 15:44:42下载
    积分:1
  • MP3-recommend-systems
    mp3荐购系统,用VB和SQL Server实现(mp3 recommend purchase system, using VB and SQL Server to achieve)
    2015-08-23 15:21:32下载
    积分:1
  • webqqVB
    visual basic 利用webqq协议登陆例子(visual basic example of the use of landing webqq agreement)
    2014-07-11 17:22:32下载
    积分:1
  • wangka
    C++编写的读取电脑C盘序列号程序.大家审查(Written in C++ C disk to read the serial number of the computer program. Everybody Review)
    2013-12-20 11:22:21下载
    积分:1
  • scrbsplt
    VC分割窗口源程序(separate window source VC)
    2004-09-11 15:25:33下载
    积分:1
  • s3c2440-gpio-kbd
    S3C2410 GPIO口下的5X5键盘驱动(S3C2410 GPIO port 5X5 keyboard driver)
    2012-05-29 10:50:07下载
    积分:1
  • VB-read-and-write-data-from-excel
    通过VB向Excel读取以及写入数据的操作(VB read and write data excel)
    2017-01-12 09:06:54下载
    积分:1
  • luck800
    抽奖程序VB编程,对设定号码进行随机抽奖(Test for voting fortunate people)
    2009-05-06 14:25:15下载
    积分:1
  • 565566
    扩展收缩对话框应用程序界面,VC++编程精选学习源码,很好的参考资料。(Expansion contraction dialog application program interface, VC++ programming featured learning source code, a good reference.)
    2013-11-19 18:57:47下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载