Small typo fix
This commit is contained in:
parent
4b06705e6c
commit
faa9ca2518
|
@ -461,7 +461,7 @@ surely contains a cycle.
|
|||
A graph is bipartite if its nodes can be colored
|
||||
using two colors so that there are no adjacent
|
||||
nodes with the same color.
|
||||
It is suprisingly easy to check if a graph
|
||||
It is surprisingly easy to check if a graph
|
||||
is bipartite using graph traversal algorithms.
|
||||
|
||||
The idea is to color the starting node blue,
|
||||
|
|
Loading…
Reference in New Issue