mirror of
https://github.com/labuladong/fucking-algorithm.git
synced 2025-07-05 03:36:39 +08:00
更改一处:使用更合适的动词,to determine bipartite graph -> to check bipartite graph
This commit is contained in:
@ -24,7 +24,7 @@ The first example is **bipartite Graph**. In brief, the bipartite graph is a spe
|
||||
|
||||

|
||||
|
||||
As we know what is a bipartite graph, what practical problems can it deal with? **In algorithms, it is usual to determine a graph is a bipartite graph or not**. For example, here is a practice in LeetCode:
|
||||
As we know what is a bipartite graph, what practical problems can it deal with? **In algorithms, it is usual to check a graph is a bipartite graph or not**. For example, here is a practice in LeetCode:
|
||||
|
||||

|
||||
|
||||
|
Reference in New Issue
Block a user