Maximum Clique#3410
Given a graph G(V, E), a clique is a sub-graph g(v, e), so that for all vertex pairs v_1, v_2 in , there exists an edge (v_1, v_2) in . Maximum clique is the clique that has maximum number of vertices.
Consists of multiple tests. The first line of each test case contains the number of vertices (1 < n ≤ 50). The following lines have numbers or each, indicating whether an edge exists between (line number) and (column number). The last line contains n = 0 and must not be processed.
For each test case print on a separate line the number of vertices in maximum clique.
Esempio 1