Assertion: graph | /r/CapableOf | use breadth-first search
Facets:
Source sentences:
text: Determining if a graph can be colored with 2 colors is equivalent to determining whether or not the graph is bipartite, and thus computable in linear time using breadth-first search or depth-first search.