1134. Vertex Cover (25)-PAT甲级真题

柳婼

已于 2023-11-09 16:04:15 修改

阅读量4k

点赞数 11

文章标签：算法 c++

于 2017-09-20 09:53:57 首次发布

本文链接：https://blog.csdn.net/liuchuo/article/details/78037329

版权

A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. Now given a graph with several vertex sets, you are supposed to tell if each of them is a vertex cover or not.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers N and M (both no more than 104), being the total numbers of vertices and the edges, respectively. Then M lines follow, each describes an edge by giving the indices (from 0 to N-1) of the two ends of the edge.

After the graph, a positive integer K (<= 100) is given, which is the number of queries. Then K lines of queries follow, each in the format: