登录
首页 » Visual C++ » Project_ShortestPath

Project_ShortestPath

于 2013-08-21 发布 文件大小:1218KB
0 141
下载积分: 1 下载次数: 5

代码说明:

  任务:实现Dijkstra算法 工程名:Project_ShortestPath 要求:实现Dijkstra算法,算法主体写在CGraph类中;要求是从command窗口中输入源节点编号,并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注:要输出整条路径,而不仅仅是前一跳,也不允许逆序输出。 (Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requirements: achieve Dijkstra algorithm, the algorithm written in the body CGraph class requires input from the command window, the source node number, and in the command window, all of the output from the source node to the destination node shortest long and the shortest. Note: To export the entire path, not just before the jump, do not allow reverse output.)

文件列表:

Project_ShortestPath
....................\Project_ShortestPath
....................\....................\Common.h,844,2009-11-06
....................\....................\Edge.cpp,1524,2012-03-05
....................\....................\Edge.h,1490,2012-03-05
....................\....................\Graph.cpp,1317,2012-06-11
....................\....................\Graph.h,782,2012-06-10
....................\....................\InputOutputManager.cpp,2425,2012-06-11
....................\....................\InputOutputManager.h,371,2012-06-10
....................\....................\Link.txt,73,2012-03-02
....................\....................\Node.txt,19,2012-02-20
....................\....................\Project_ShortestPath.cpp,592,2012-06-11
....................\....................\Project_ShortestPath.vcproj,5092,2012-03-02
....................\....................\Project_ShortestPath.vcproj.4305665D3DFD4AD.Administrator.user,1427,2010-04-02
....................\....................\Project_ShortestPath.vcproj.hzc-PC.hyq.user,1409,2012-06-11
....................\....................\Project_ShortestPath.vcproj.VFGRFY0D6XD50WI.Administrator.user,1427,2012-03-21
....................\....................\ReadMe.txt,1028,2010-04-02
....................\....................\stdafx.cpp,216,2012-02-20
....................\....................\stdafx.h,296,2012-02-20
....................\....................\Vertex.cpp,660,2012-06-11
....................\....................\Vertex.h,717,2012-06-11
....................\Project_ShortestPath.ncb,6491136,2012-06-11
....................\Project_ShortestPath.sln,925,2010-04-02

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

发表评论

0 个回复

  • findpt
    VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)
    2013-05-17 15:38:23下载
    积分:1
  • arrangement
    假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。) 对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
    2014-10-22 11:00:45下载
    积分:1
  • luciferLanguage
    这是acm里关于魔王语言的一道题,通过栈和队列的知识来解决。(this is balout luciferlanguage . i use the datastructure with stack and queue.)
    2011-11-28 17:04:19下载
    积分:1
  • LR(0)
    简单LR语法分析程序自动生成器的实现,可用作数据结构课程设计(LR (0) grammar analysis)
    2013-09-22 09:26:25下载
    积分:1
  • CAR
    some problems about c++.(car.cpp)
    2012-01-12 14:39:48下载
    积分: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
  • 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
  • c++
    一款可以排序的小程序,希望大家可以看一下(A sort of small program, I hope you can look at it)
    2017-12-13 20:06:55下载
    积分:1
  • DisplayBTree
    代码注重B树插入、删除的算法逻辑,适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )
    2006-07-19 00:00:38下载
    积分:1
  • PX
    说明:  一个用VS2008编写的冒泡排序算法演示程序,数组都是随机生成的。(Bubble Sort)
    2014-06-18 20:06:13下载
    积分:1
  • 696518资源总数
  • 104349会员总数
  • 32今日下载