Is Graph Bipartite?

Given an undirected graph with n nodes (0..n-1), print true if its nodes can be split into two sets such that every edge connects nodes from different sets.

1 <= n <= 100 0 <= m <= n * (n - 1) / 2