4-2 Shortest Path [4]

最新推荐文章于 2023-06-24 15:19:43 发布

dxz935

最新推荐文章于 2023-06-24 15:19:43 发布

阅读量2k

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/dxz935/article/details/53372322

版权

编写程序计算带权重的有向图中从任意顶点到指定源顶点的最短路径。如果存在多个最小路径，选择边数最少的路径。保证所有权重均为正数，并且从任一顶点到源顶点的最短路径是唯一的。

摘要由CSDN通过智能技术生成

Write a program to find the weighted shortest distances from any vertex to a given source vertex in a digraph. If there is more than one minimum path from v to w, a path with the fewest number of edges is chosen. It is guaranteed that all the weights are positive and such a path is unique for any vertex.

Format of functions:

void ShortestDist( MGraph Graph, int dist[], int path[], Vertex S );

where MGraph is defined as the following:

typedef struct GNode *PtrToGNode;
struct GNode{
    int Nv;
    int Ne;
    WeightType G[MaxVertexNum][MaxVertexNum];
};
typedef PtrToGNode MGraph;

The shortest distance from V to the source S is supposed to be stored in dist[V]. If V cannot be reached from S, store -1 instead. If W is the vertex being visited ri