登录
首页 » Visual C++ » Dijlstra

Dijlstra

于 2009-01-11 发布 文件大小:68KB
0 140
下载积分: 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 个回复

  • toycon
    二查树遍历文件,可以用于程序测试,有喜欢的朋友要多多使用哦(Two check tree traversal file that can be used for program testing)
    2012-07-17 15:18:23下载
    积分:1
  • SHU
    为了点分 求分下载好麻烦 c++二叉排序树(In order to find points dotted download good trouble c++ binary sort tree)
    2013-07-25 01:35:56下载
    积分:1
  • tcpip
    以太网首部的一个c语言程序,代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)
    2013-03-26 11:49:23下载
    积分:1
  • Huffman
    说明:  数据结构:Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛,如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树,是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)
    2011-03-29 22:44:59下载
    积分:1
  • yuesehuhuan
    就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)
    2007-11-22 11:35:10下载
    积分:1
  • ddt
    多段图、遍历、排序。用C语言解决多段图中的成本问题,得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )
    2012-05-12 13:49:10下载
    积分:1
  • Maze
    c++用栈来实现迷宫求解(c语言数据结构)(c++ stack maze solving (c language data structure))
    2012-10-27 23:08:34下载
    积分:1
  • graph-DFS
    邻接表存储图,然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
    2013-10-27 20:16:41下载
    积分:1
  • josephus
    通过c语言数组算法解决josephus问题,m个人围成一圈,从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开,最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)
    2017-11-12 10:30:06下载
    积分:1
  • BDX
    设计、编写和调试面向对象C++程序,实现任意两个同类数据比大小 的通用函数(模板),涵盖普通数值型数据之间的比较、两个字符串之间的比较 (按字典序)、两个复数之间的比较(按模大小)等,并通过主函数加以调用和 测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)
    2020-11-28 13:49:29下载
    积分:1
  • 696518资源总数
  • 104384会员总数
  • 26今日下载