1142 Maximal Clique (25 分)图论找子集两两相连能不能扩充

A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a clique that cannot be extended by including one more adjacent vertex. (Quoted from https://en.wikipedia.org/wiki/Clique_(graph_theory))

Now it is your job to judge if a given subset of vertices can form a maximal clique.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers Nv (≤ 200), the number of vertices in the graph, and Ne, the number of undirected edges. Then Ne lines follow, each gives a pair of vertices of an edge. The vertices are numbered from 1 to Nv.

After the graph, there is another positive integer M (≤ 100). Then M lines of query follow, each first gives a positive number K (≤ Nv), then followed by a sequence of K distinct vertices. All the numbers in a line are separated by a space.

Output Specification:

For each of the M queries, print in a line Yes if the given subset of vertices can form a maximal clique; or if it is a clique but not a maximal clique, print Not Maximal; or if it is not a clique at all, print Not a Clique.

Sample Input:

8 10
5 6
7 8
6 4
3 6
4 5
2 3
8 2
2 7
5 3
3 4
6
4 5 4 3 6
3 2 8 7
2 2 3
1 1
3 4 3 6
3 3 2 1

Sample Output:

Yes
Yes
Yes
Yes
Not Maximal
Not a Clique

题意：给出顶点数和边数，再给出查询的次数，每次查询中都会列几个顶点，查子集两两相连能不能扩充。
思路：先用二维矩阵存储顶点和边之间的关系，先判断子集的顶点之间是不是两两相连的，不能就直接输出Not a Clique，能的话再判断其他顶点能不能对这个子集中的点全部都连通，如果都不能的话输出Yes,能的话输出Not Maximal。判断子集外的点对子集上顶点的连通性就直接先用hash存储之前子集上的点，将总体集合中不在hash上的值遍历过去，与子集中的顶点进行判断有无连通性。

#include<iostream>
#include<cstdio>
#include<stack> 
#include<queue>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>