bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Small typo fix

This commit is contained in:
Antti H S Laaksonen 2017-02-12 20:33:00 +02:00
parent 4b06705e6c
commit faa9ca2518
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
luku12.tex
View File

@ -461,7 +461,7 @@ surely contains a cycle.
A graph is bipartite if its nodes can be colored A graph is bipartite if its nodes can be colored
using two colors so that there are no adjacent using two colors so that there are no adjacent
nodes with the same color. 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. is bipartite using graph traversal algorithms.
The idea is to color the starting node blue, The idea is to color the starting node blue,