The Agent Skills Directory

[SAFE]: The code correctly identifies whether an induced subgraph is bipartite by checking if it can be represented as the union of two independent sets. It uses the Fast Subset Transform (SOS DP) to efficiently count the number of ways to form each subset as a union of two independent sets. The complexity of $O(N \cdot 2^N)$ is appropriate for the given constraint $N \le 20$. The logic is sound, and no malicious patterns such as prompt injection, data exfiltration, or unauthorized code execution are present.

csv-summarizer