本项目是《数据结构与算法实习》的大作业项目。
使用FastWVC[1]算法求出补图的一个最小点覆盖，从而求出原图的一个最大团。
This project is an assignment of "Practice for Data Structures and Algorithms".
We use the FastWVC[1] Algorithm to find a minimal vertex cover of the complement graph, and therefore find a maximal clique of the original graph.
[1]: S. Cai, et al. "Towards faster local search for minimum weight vertex cover on massive graphs"