c编写 Shortest Path [3]

最新推荐文章于 2025-09-22 07:15:00 发布

原创

最新推荐文章于 2025-09-22 07:15:00 发布 · 2.7k 阅读

收录于

这篇博客介绍了如何使用C语言编写程序，找到有向图中从任意顶点到指定源顶点的加权最短路径，并计算不同最短路径的数量。所有权重保证为正数。内容包括函数格式、样例程序和输入输出示例。

Shortest Path [3] (10分)

Write a program to not only find the weighted shortest distances, but also count the number of different minimum paths from any vertex to a given source vertex in a digraph. It is guaranteed that all the weights are positive.

Format of functions:

void ShortestDist( MGraph Graph, int dist[], int count[], 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. The number of different minimum paths from