本文探讨了HDU 1530题目，涉及图论中的经典问题——最大团问题。通过对题目的解析，阐述了解决此类问题的思路和方法。
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1530
Maximum Clique
Problem Description
Given a graph G(V, E), a clique is a sub-graph g(v, e), so that for all vertex pairs v1, v2 in v, there exists an edge (v1, v2) in e. Maximum clique is the clique that has maximum number of vertex.
Input
Input contains multiple tests. For each test:
The first line has one integer n, the number of vertex. (1 < n <= 50)
The following n lines has n 0 or 1 each, indicating whether an edge exists between i (line number) and j (column number).
A test with n = 0 signals the end of input. This test should not be processed.
</
The first line has one integer n, the number of vertex. (1 < n <= 50)
The following n lines has n 0 or 1 each, indicating whether an edge exists between i (line number) and j (column number).
A test with n = 0 signals the end of input. This test should not be processed.
</
最低0.47元/天 解锁文章
扫一扫
3594
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
