登录
首页 » Visual C++ » structure-array-code

structure-array-code

于 2013-10-09 发布 文件大小:6003KB
0 223
下载积分: 1 下载次数: 1

代码说明:

  根据队列搜索算法的基本思想,现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能,可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of ​ ​ the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)

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

发表评论

0 个回复

  • edge-betweenness
    计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
    2021-05-15 01:30:03下载
    积分:1
  • Mult
    说明:  数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)
    2011-03-20 20:28:31下载
    积分:1
  • FRFT-algorim
    常在该网站下载资料,也想分享些材料上去,这个资料是FRFT算法(Often the site to download information, but also want to share some material up, this information is FRFT algorithm)
    2020-07-04 13:00:02下载
    积分:1
  • LINKLIST
    单链表的增删查改功能,可以实现单链表的创建、传入数据;并能实现对已有单链表的插入数据、删除数据等功能。(Single linked list of additions and deletions check change function, you can achieve the creation of a single list, incoming data insert data of existing single linked list, delete data and functions.)
    2012-10-31 21:03:50下载
    积分:1
  • BinaryTreeViaMFC
    画图法实验数据结构中二叉树先序、中序、后序遍历和显示。(Paint Method in the first order binary tree data structure, in order, post order traversal and display.)
    2011-05-27 20:14:36下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • xuanzexingjiegou
    选择型结构c语言编程 (Choose the type of structure of C language programming)
    2013-09-24 22:11:37下载
    积分: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
  • hellow4
    序列二次规划算法,能求解包含约束和无约束的问题,非常方便。(Sequential quadratic programming algorithm to solve constrained and unconstrained contain the problem, very convenient.)
    2021-01-08 18:18:51下载
    积分:1
  • Joseph
    说明:  约瑟夫问题,四种解法,分别是静态链表,顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)
    2010-04-23 08:20:53下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载