登录
首页 » Visual C++ » Dijkstra

Dijkstra

于 2010-09-25 发布 文件大小:886KB
0 201
下载积分: 1 下载次数: 79

代码说明:

  主要是DIJKSTRA经典算法,可以作为单个算法来读,也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)

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

发表评论

0 个回复

  • Graph
    数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
    2013-11-28 10:53:29下载
    积分:1
  • xiao-yuan-dao-you
    说明:  设计济南大学校园平面图,所含的景点不少于10个。以图中顶点表示校内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询,即查询任意两个景点之间的一条最短的简单路径。 选作内容: 求校园的关节点。 提供图中任意景点查询,即求任意两点间的所有路径。 校园导游图的景点和道路的修改扩充功能。 扩充道路信息,如道路类别,沿途景色等级,一直可按客人所需分别查询人行路径或车行路径或观景路径。(Design jinan university campus plan, contains at least 10 spots in each vertex said in scenic spots, deposit attractions at the information such as the code name introduction On the path, deposit path length said related information )
    2011-03-21 19:54:06下载
    积分:1
  • ds-labs
    说明:  数据结构基本算法实现。包括栈、二叉树基本运算实现,同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)
    2011-03-27 03:01:02下载
    积分:1
  • a
    说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
    2013-07-04 19:50:58下载
    积分:1
  • elevator
    电梯模拟,实现一个模拟电梯的环境,用C程序实现的,封装良好(elevator modify)
    2021-04-22 15:38:48下载
    积分: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
  • zuiyouerfenjiansuozhu
    最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
    2013-10-10 18:48:17下载
    积分:1
  • JGMFC
    一个MFC编的算法分析课程设计实验“重排九宫源码”(MFC compiled an algorithm analysis course design experiment " rearrangement kau kung source" )
    2010-03-11 16:13:32下载
    积分:1
  • paixu
    2008软件公司面试题:排序大全:简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序(利用递归)(2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSORT (from small to large), Merging Sort (recursive))
    2008-12-10 16:53:40下载
    积分:1
  • reverse
    本实验设有一个线性表,分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)
    2013-05-29 14:25:34下载
    积分:1
  • 696516资源总数
  • 106436会员总数
  • 7今日下载