摘要： 题目链接。The Largest SCC题目描述Consider a directed graph with N (1 <= N <= 1000) vertices and M (0 <=M <= 20000) edges. The edges are numbered from 1 to M and the verticesare numbered from 1 to N. Now I will make ONE edge bidirectional, andyou are to tell me the number of vertices of the larges 阅读全文