该博客介绍了一道关于判断给定的拓扑序列是否符合有向无环图（DAG）的题目。博客提供了输入输出规格，示例输入输出，并详细解释了题目的意思，即检查给定的顶点排列是否构成拓扑排序。解决方案是通过存储图的边，跟踪每个节点的入度，并在遍历序列时更新入度，如果发现入度不为0，则序列无效。
题目
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 ) N(\le1,000) N(≤1,000), the number of vertices in the graph, and M ( ≤ 10 , 000 ) M(\le10,000) M(≤10,000), the number of directed edges. Then M M M lines follow, each gives the start and the end vertices of an edge. The vertices are numbered from 1 to N N N
最低0.47元/天 解锁文章
扫一扫
363
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
