একটি গ্রাফ Bipartite হবে যদি গ্রাফটির ভার্টেক্স এর সেট V কে দুটি পৃথক disjoint set V1 and V2 তে ভাগ করা যায় যেখানে প্রত্যেক edge V1 and ...
Read More
Showing posts with label bipartite. Show all posts
Showing posts with label bipartite. Show all posts
LightOj 1009 Back to Underworld
Hints : Bipartite Approach. Just use two colors to mark Vampires and Lycans. Then find who are maximum . As graph may be disconnected...
Read More
UVA 11080 Place the Guards
Hints : It's a Bipartite Checking problem but there are some tricky cases. Some Nodes May be disconnected, so it's important ...
Read More
UVA 11396 Claw Decomposition
#include <bits/stdc++.h> using namespace std; vector<int>edges[1000]; queue<int>q; int color[1000],visited[10...
Read More
UVA 10004 Bicoloring
#include <bits/stdc++.h> using namespace std; vector<int>edges[1000]; queue<int>q; int color[1000],visited[...
Read More
Subscribe to:
Posts
(
Atom
)