OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Performed the requested changes

Browse Source
This commit is contained in:
AkVaya 2020-08-14 01:43:57 +05:30
parent 97f3e1a076
commit d87a6685f6
1 changed files with 16 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
graph/is_graph_bipartite.cpp
View File

@ -2,13 +2,14 @@
* @file is_graph_bipartite * @file is_graph_bipartite
* *
* @brief Algorithm to check whether a graph is bipartite * @brief Algorithm to check whether a graph is bipartite
* (https://en.wikipedia.org/wiki/Bipartite_graph)
* *
* @details * @details
* A graph is a collection of nodes also called vertices and these vertices * A graph is a collection of nodes also called vertices and these vertices
* are connected by edges.A bipartite graph is a graph whose vertices can be * are connected by edges.A bipartite graph is a graph whose vertices can be
* divided into two disjoint and independent sets U and V such that every edge * divided into two disjoint and independent sets U and V such that every edge
* connects a vertex in U to one in V. * connects a vertex in U to one in V.
* (https://en.wikipedia.org/wiki/Bipartite_graph) *
* The given Algorithm will determine whether the given graph is bipartite or not * The given Algorithm will determine whether the given graph is bipartite or not
* *
* *
@ -32,9 +33,6 @@
#include <vector> #include <vector>
#include <queue> #include <queue>
using std::vector;
using std::queue;
const int nax = 5e5 + 1; const int nax = 5e5 + 1;
/** /**
* Class for representing graph as an adjacency list. * Class for representing graph as an adjacency list.
@ -43,9 +41,9 @@ class graph {
private: private:
int n; /// size of the graph int n; /// size of the graph
vector<vector <int> > adj; /// adj stores the graph as an adjacency list std::vector<std::vector <int> > adj; /// adj stores the graph as an adjacency list
vector<int> side; ///stores the side of the vertex std::vector<int> side; ///stores the side of the vertex
public: public:
/** /**
@ -74,12 +72,14 @@ void graph::addEdge(int u, int v) {
} }
/** /**
* @brief function that checks whether the graph is bipartite or not * @brief function that checks whether the graph is bipartite or not
* the function returns true if the graph is a bipartite graph
* the function returns false if the graph is not a bipartite graph
*/ */
bool graph::is_bipartite(){ bool graph::is_bipartite(){
n = adj.size(); n = adj.size();
side.resize(n,-1); side.resize(n,-1);
bool check = true; bool check = true;
queue<int> q; std::queue<int> q;
for (int current_edge = 0; current_edge < n; ++current_edge) for (int current_edge = 0; current_edge < n; ++current_edge)
{ {
if(side[current_edge] == -1){ if(side[current_edge] == -1){
@ -103,9 +103,9 @@ bool graph::is_bipartite(){
return check; return check;
} }
/** /**
* Main funtion * Function to test the above algorithm
*/ */
int main(){ void test(){
graph G1(5); /// creating graph G1 with 5 vertices graph G1(5); /// creating graph G1 with 5 vertices
/// adding edges to the graphs as per the illustrated example /// adding edges to the graphs as per the illustrated example
G1.addEdge(1,2); G1.addEdge(1,2);
@ -118,6 +118,7 @@ int main(){
G2.addEdge(1,2); G2.addEdge(1,2);
G2.addEdge(1,3); G2.addEdge(1,3);
G2.addEdge(2,3); G2.addEdge(2,3);
/// checking whether the graphs are bipartite or not /// checking whether the graphs are bipartite or not
if(G1.is_bipartite()){ if(G1.is_bipartite()){
std::cout<<"The given graph G1 is a bipartite graph\n"; std::cout<<"The given graph G1 is a bipartite graph\n";
@ -131,5 +132,11 @@ int main(){
else{ else{
std::cout<<"The given graph G2 is not a bipartite graph\n"; std::cout<<"The given graph G2 is not a bipartite graph\n";
} }
}
/**
* Main function
*/
int main(){
test(); ///Testing
return 0; return 0;
} }