A bipartite graph is one in which the nodes of the graph can be divided into two sets, A and B, such that there are no edges going within nodes in the same sets. In other words, every edge in the graph goes between A and B (note that this does not mean that every node in A is connected to every node in B). Create an efficient algorithm to determine whether a connected graph is a bipartite graph.