登录
首页 » Visual C++ » Ex3

Ex3

于 2012-11-27 发布 文件大小:1KB
0 194
下载积分: 1 下载次数: 2

代码说明:

  c++实现的静态链表 可以从屏幕输入来构建静态链表 数据结构重要的部分(c++ implemented statically linked list can be input from the screen to the important part to build a static linked list data structure)

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

发表评论

0 个回复

  • edge-betweenness
    计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
    2021-05-15 01:30:03下载
    积分:1
  • crox
    矩形件最优排样的程序,用Visual C编写,在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)
    2013-05-13 14:31:41下载
    积分:1
  • duilie
    队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)
    2010-09-08 14:36:38下载
    积分:1
  • Kruskal
    克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
    2009-06-27 01:43:39下载
    积分:1
  • jiaotongzixun
    数据结构的课程设计,做的是一个交通查询,主要用到图的算法,和大家共享,欢迎指正!(Data structure curriculum design, do a query traffic, mainly used graph algorithms, and share, please correct me!)
    2013-10-28 18:49:11下载
    积分:1
  • Dijkstra
    迪特斯特拉算法,课程设计的作品,主要计算站点距离的吧,可以看看(Dieter Stella algorithm, distance course design work, the main computing sites can look)
    2013-04-11 10:26:15下载
    积分:1
  • Introduction-to-Algorithms
    算法导论的英文版,讲解算法的非常经典的书。(English version of Introduction to Algorithm. A classical book to teach algorithm.)
    2015-09-14 16:44:34下载
    积分:1
  • Ex1
    从屏幕输入字符 判断括号匹配问题 数据结构作业(Judgment parenthesis matching data structure operations input characters from the screen)
    2012-11-27 15:17:10下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • yinhangmoni
    这是一个简单的银行模拟系统 1、 客户的到达时间随机 2、 客户需要处理的业务随机(不同业务处理的平均长度不同,例如:取款时间较短,开户和销户时间较长) 3、 处理客户业务所需时间随机(在一定范围内) 4、 使用文本文件记录每个客户到达时间、业务处理时间、业务结束时间 5、 动态显示(刷新时间可调)目前每个窗口累计处理客户数量、等待人数,每个窗口的平均业务处理时间,不同业务类型业务的累计办理量。 (This is a simple bank simulation system 1 customer arrival time random 2, customers need to deal with the business of random (the average length of the different business processes, such as: the withdrawal shorter, longer to open an account and cancel the account) 3, the time required to deal with customer service random (within certain limits) 4, using a text file to record each customer arrival time, business processing time, the business end of time 5 dynamically display (refresh time is adjustable) each window is accumulated to handle the number of customers waiting for the number the average business processing time of each window, different type of business operations total for the amount.)
    2012-11-22 00:08:18下载
    积分:1
  • 696518资源总数
  • 105554会员总数
  • 2今日下载