PAT 1163 Dijkstra Sequence

最新推荐文章于 2023-05-17 01:38:10 发布

啥都不会的废铁

最新推荐文章于 2023-05-17 01:38:10 发布

阅读量403

点赞数 1

文章标签：数据结构图搜索算法 c++ 算法

本文链接：https://blog.csdn.net/weixin_45840763/article/details/122788279

版权

该博客介绍了PAT中的1163题——Dijkstra序列。Dijkstra算法是解决单源最短路径问题的贪婪算法。题目要求判断给定的序列是否为Dijkstra序列，即通过Dijkstra算法从源点开始逐步生成的非降序序列。博客给出了输入输出规格，并提供了思路，即对每个序列模拟Dijkstra算法，如果最终顺序是非降序，则答案为Yes，否则为No。

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

1163 Dijkstra Sequence (30 分)

Dijkstra's algorithm is one of the very famous greedy algorithms. It is used for solving the single source shortest path problem which gives the shortest paths from one particular source vertex to all the other vertices of the given graph. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.

In this algorithm, a set contains vertices included in shortest path tree is maintained. During each step, we find one vertex which is not yet included and has a minimum distance from the source, and collect it into the set. Hence step by step an ordered sequence of vertices, let's call it Dijkstra sequence, is generated by Dijkstra's algorithm.

On the other hand, for a given graph, there could be more than one Dijkstra sequence. For example, both { 5, 1, 3, 4, 2 } and { 5, 3, 1, 2, 4 } are Dijkstra sequences for the graph, where 5 is the source. Your job is to check w