PAT A1146 2019.08.24 【拓扑排序】

Doria_Lee

于 2019-08-25 22:16:42 发布

阅读量142

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/lidaorui1001/article/details/100068696

版权

这篇博客详细介绍了如何解决2018年研究生入学考试中的一道关于拓扑排序的问题。文章首先给出了输入和输出规格，接着描述了输入包含的顶点数量、边的数量以及每个边的起点和终点。然后是查询的数量，每个查询是一组顶点的排列。任务是找出哪些排列不是拓扑排序。博主分享了自己的思路，指出理解入度和出度的概念是解决问题的关键，并强调这是他首次尝试编写拓扑排序的程序。

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

1146 Topological Order (25 分)

This is a problem given in the Graduate Entrance Exam in 2018: Which of the following is NOT a topological order obtained from the given directed graph? Now you are supposed to write a program to test each of the options.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers N (≤ 1,000), the number of vertices in the graph, and M (≤ 10,000), the number of directed edges. Then M lines follow, each gives the start and the end vertices of an edge. The vertices are numbered from 1 to N. After the graph, there is another positive integer K (≤ 100). Then K lines of query follow, each gives a permutation of all the vertices. All the numbers in a line are separated by a space.