lukefleed
/
competitive-programming
mirror of https://github.com/lukefleed/competitive-programming
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '92681d39e9'
${ noResults }
competitive-programming/2023_11_30/is-bipartite
History
Luca Lombardo 3108b2e612 new prolem solved 9 months ago
..
src new prolem solved 9 months ago
Cargo.toml new prolem solved 9 months ago
README.md new prolem solved 9 months ago

README.md

Idea

A graph is bipartite means that it can be divided into two sets of nodes, such that all edges connect a node from one set to a node from the other set. Let's call this set A and B. The simplest way to understand the idea is to say that this node in this graph cannot be in the same set as his neighbor.

We can create the two sets as EVEN and ODD. We start from a node and we put it in the EVEN set. Then we put all his neighbors in the ODD set. Then we put all their neighbors in the EVEN set, and so on. If we find a node that is already in a set, and we try to put it in the other set, then we have a conflict and the graph is not bipartite.