登录
首页 » C++ » Dijkstra

Dijkstra

于 2007-08-07 发布 文件大小:1KB
0 118
下载积分: 1 下载次数: 34

代码说明:

  求数组最长递增子序列算法。输入一个数组,输出其最大递增子序列(Array for the longest increasing subsequence algorithm. An array of input and output its maximum incremental sequence)

文件列表:

Dijkstra.cpp

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

发表评论


0 个回复

  • CCPP-count-number
    C/C++写的求小于N的素数,速求,求效率,适合大家看看。(count any numbers less than a order number by c/c++,very quickly,you can learn someting from it.)
    2012-08-01 20:47:34下载
    积分:1
  • usercreep
    编制了theta映射法的ansys蠕变子程序(a creep subroutine of ansys that considered the theta-projection method)
    2018-06-19 14:19:39下载
    积分:1
  • 096172
    应用方便的OrbMath数学运算库,适用于多种语言()
    2018-04-05 16:13:55下载
    积分:1
  • ftcs-code
    fortran based code for 1d heat equation
    2014-10-06 02:17:56下载
    积分:1
  • FDTD
    是以有限差分算法的MATLAB实现,可以运行的,给出谐振腔的场强的表示方法(finite diffenence time domain programmed by matlab language is for cavity, and its elelctro magnetic field can be showed.)
    2009-04-28 08:17:33下载
    积分:1
  • aboat-shuzhi-fenxi
    数值分析计算课程的部分习题答案,有matlab编程,希望对大家有用。(some small matlab codes .)
    2012-08-17 22:28:01下载
    积分:1
  • Transmission-Network-Expans1on
    应用遗传算法做电网规划,把遗传算法应用于输电网络规划,提出了基于遗传算 法的输电网络规划模型,以新建线路的投资费用和系统年运 行费用之和最小为目标函数,建立了输电网络规划的数学模型。该模型还考虑了“N-1”事故检验,使得规划方案更加合理。以Garver-6节点系统为例进行优化规划(The application of genetic algorithms to do network planning)
    2020-07-30 09:18:39下载
    积分:1
  • Gmres
    说明:  解大规模线性方程组的预条件Gmres方法.系数矩阵可以非对称正定.(Solution of large-scale linear equations of the preconditioned GMRES method. Coefficient matrix can be non-symmetric positive definite.)
    2008-10-15 00:11:34下载
    积分:1
  • 可以实现求解微分方程组的值解 func
    可以实现求解微分方程组的数值解,在func中输入需要计算的微分方程组,运行主函数即可(Can be achieved to solve the numerical solution of differential equations, the input need to calculate the differential equations in the func to run the main function can be)
    2012-07-02 11:40:59下载
    积分:1
  • 12
    说明:  该LINGO程序的功能是:求出工程项目的收益的净现值和每道工序的最优开工时间,约束条件是紧前紧后约束,以及资源约束。。。(The program' s function is LINGO: the project proceeds to derive the net present value of each procedure and the optimal start time constraints are tight after the former tight constraints, and resource constraints. . .)
    2009-07-14 19:33:05下载
    积分:1
  • 696518资源总数
  • 104971会员总数
  • 8今日下载