Answer Happy

1: Introduction Problem description and (if any) background of the algorithms. Description: The complete subgraph with the largest number of vertices in an undirected graph G is called the maximum clique. Input an undirected graph with n vertices (vertex number is 1 ~ n) and m edges, and find the number of vertices of its maximum clique. (一个无向图G中含顶点个数最多的完全 子图称为最大团。输入含n个顶点(顶 点编号为1~n)、m条边的无向图,求 其最大团的顶点个数。) Input: Input multiple test cases. The first line of each test case contains two positive integers n and m, and the next m lines contain two integers s and t in each line, indicating that there is an edge between vertex s and t, which ends with input n=0 and m=0, assuming 1-n-50 and 1-m-300. (输入多个测试用例,每个测试用例的 第1行包含两个正整数n、m,接下来m 行,每行两个整数s、t,表示顶点s和t 之间有一条边,以输入n=0、m=0结 束,规定1n50、1.m300。) Output: Output one line for each test case, indicating the number of vertices of the corresponding maximum clique. (每个测试用例输出一行,表示相应的

512233 623445 56 12 23 24 34 35 45 00 Sample Output 3 2: Algorithm Specification Description (pseudo-code preferred) of all the algorithms involved for solving the problem, including specifications of main data structures. 3: Testing Results Table of test cases. Each test case usually consists of a brief description of the purpose of this case, the expected result, the actual behavior of your program, the possible cause of a bug if your program does not function as expected, and the current status ("pass", or "corrected", or "pending").

Appendix: Source Code (in C/C++) At least 30% of the lines must be commented.