登录
首页 » Visual C++ » Dijlstra

Dijlstra

于 2009-01-11 发布 文件大小:68KB
0 231
下载积分: 1 下载次数: 3

代码说明:

  Dijlstra算法 对任意图,选择合适的数据结构表示图,在此基础上实现求解最短路径的Dijkstra算法(Dijlstra algorithm to arbitrary map, select the appropriate data structures that map, on this basis to achieve solution of the Dijkstra shortest path algorithm)

文件列表:

苗奕-0604012002-Dijlstra算法
............................\xixi.cpp
............................\xixi.exe
............................\苗奕-0604012002-Dijlstra算法.doc
............................\课程设计感想.doc

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

发表评论

0 个回复

  • LongestIncreasingSequence
    找出数组A中最长的递增序列的长度,使用动态规划算法,复杂度为O(N*N)。(Find the longest increasing sequence)
    2011-09-05 17:36:27下载
    积分:1
  • Polynomial
    Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)
    2013-12-11 11:05:18下载
    积分:1
  • select
    采用Dijkstra算法和Floyd算法实现的简单医院选址系统(data structure)
    2009-03-11 20:23:09下载
    积分:1
  • chain
    链表的模板类,提供插入删除,遍历器,查找等功能,只有一个头文件,可以包含到你的工程(template implemention of Chain)
    2013-12-09 11:04:33下载
    积分:1
  • paixu
    简单选择排序,这是个解决排序问题的一个算法模型之一。(Sort simple choice, this is a solution to a scheduling problem, one algorithm model.)
    2008-06-24 00:40:18下载
    积分:1
  • cengcipianli
    按照一定的输入求出二叉树的层次遍历,输出相应的结果(Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results)
    2012-06-08 21:44:41下载
    积分:1
  • yeschengxu
    这是数据结构很重要的程序,主要是课后题的答案,和代码,功能很强大(the data struct of the book)
    2013-12-22 23:25:14下载
    积分:1
  • ANT
    A*算法通过启发式探索下一结点,逐步逼近目标结点,且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)
    2012-05-17 09:14:21下载
    积分:1
  • structure-array-code
    根据队列搜索算法的基本思想,现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能,可以较好的实现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.)
    2013-10-09 14:35:43下载
    积分:1
  • kruscal_Primspanningtree
    最小生成树两种经典算法,kruscal和Prim算法(spanning tree)
    2010-07-14 10:10:54下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载