[UVA][SCC] 11324 - The Largest Clique
Problem B: The Largest Clique
Given a directed graph G, consider the following transformation. First, create a new graph
T(G) to have the same vertex set as G. Create a directed edge between
two vertices u and v in T(G) if and only if there is a path
between u an...
