登录
首页 » Visual C++ » suanfa

suanfa

于 2012-09-02 发布 文件大小:10KB
0 225
下载积分: 1 下载次数: 3

代码说明:

  自己编写的floyd 最短距离求解程序。实用简单。gcc (Floyd shortest distance to write your own solver. Practical and simple. gcc)

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

发表评论

0 个回复

  • MultifunctionalCalculator
    基于MFC平台,实现多功能计算器,可求解复杂表达式,主要实现为数据结构中链表和数组,对于要熟悉链表和数组的初学者有很帮助。(Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the list and the array of beginners helpful.)
    2016-10-04 13:20:37下载
    积分:1
  • sad
    编程 主范式 使用真植表 用栈的应用 使用了 后缀表达式 (biancheng zhu fanshi)
    2012-06-18 14:16:30下载
    积分:1
  • KMP
    说明:  KMP算法的具体实现,能够在O(n+m)时间内找出字串在父串中的位置,n为父串长度,m为字串长度(KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length)
    2010-04-28 16:18:00下载
    积分:1
  • cPP
    数据结构课设,城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)
    2011-07-03 11:58:24下载
    积分:1
  • jiaotong
    用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)
    2013-03-23 13:06:49下载
    积分:1
  • mapsearch
    数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
    2016-01-09 17:34:45下载
    积分:1
  • Nqueen
    n皇后问题构造法实现,比起启发式修补运行时间较长。(n Queen realize the issue of construction method, compared to a longer run-time heuristic repair.)
    2008-05-16 12:45:32下载
    积分: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
  • 123
    校园导航系统 1) 校园景点介:绍介相关景点的有关详细信息。 2) 最佳路线查询:查询校园中任意两点之间所有路线,并提供两点间最短的简单路径。 3) 关节点查询:提供校园图的关节点查询。 4) 多景点最佳路线查询:提供多个景点的最佳线路查询,即求途径这个景点的最佳路径。 (Campus Navigation System 1) campus attractions Introduction: Shao Jie-related attractions for more information. 2) The best route query: Query on campus all the routes between any two points, and provides a simple shortest path between two points. 3) joint points: the key points to provide the campus map queries. 4) The best route queries more attractions: multiple sites to provide the best route queries, that is seeking ways to this spot the best path.)
    2011-08-25 08:56:05下载
    积分:1
  • deep-copy
    该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
    2014-01-03 10:46:48下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载