/*
* (0)________>(2)
* | / \
* | / \
* (5)----(3)-----(4)
*/
TEST(DirectedBreadthFirstPathSearch, pathTo) {
DirectedGraph graph {20};
graph.addEdge(0, 2);
graph.addEdge(2, 3);
graph.addEdge(2, 4);
graph.addEdge(3, 5);
graph.addEdge(0, 5);
const DirectedBreadthFirstPathSearch search (&graph, 0);
Iterator<int>* it = search.pathTo(5);
EXPECT_EQ(0, it->next());
EXPECT_EQ(5, it->next());
EXPECT_EQ(false, it->hasNext());
}
int main(){
DirectedGraph<int> g;
g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);
if(cycleCheck(&g))cout<<"cyclic graph"<<endl;
else cout<<"acyclic graph"<<endl;
/*Create minimum spanning tree of unweighted graph
Graph<int> g;
g.addEdge(1, 0);
g.addEdge(0, 2);
g.addEdge(2, 1);
g.addEdge(0, 3);
g.addEdge(3, 4);
minimumSpanningTree(&g);*/
/* Find shortest path between two vertices
Graph<int> g;
g.addEdge(1, 0);
g.addEdge(0, 2);
g.addEdge(2, 1);
g.addEdge(0, 3);
g.addEdge(3, 4);
shortestPath(&g, 1, 3);
*/
/* Check if graph is bipartite
Graph<int> g;
g.addEdge(0,1);
g.addEdge(1,2);
g.addEdge(0,2);
if(isBipartiteBFS(&g))cout<<"Bipartite"<<endl;
else cout<<"Not bipartite"<<endl;
if(isBipartiteDFS(&g))cout<<"Bipartite"<<endl;
else cout<<"Not bipartite"<<endl;*/
/* Print reverse topological order
DirectedGraph<int> g;
g.addEdge(5, 2);
g.addEdge(5, 0);
g.addEdge(4, 0);
g.addEdge(4, 1);
g.addEdge(2, 3);
g.addEdge(3, 1);
g.print();
topologicalSort(&g);
*/
/* Find path between two vertices
Graph<int> g1;
g1.addEdge(1, 0);
g1.addEdge(0, 2);
g1.addEdge(2, 0);
g1.addEdge(0, 3);
g1.addEdge(3, 4);
Graph<int> g2;
g2.addEdge(0, 1);
g2.addEdge(1, 2);
findPathDFS(&g1, 0, 4);
*/
//check cycle in graph using DFS
/*if(cycleCheckBFS(&g1))cout<<"Cycle is present"<<endl;
else cout<<"Cycle is not present"<<endl;*/
/*if(cycleCheckBFS(&g2))cout<<"Cycle is present"<<endl;
else cout<<"Cycle is not present"<<endl;*/
//check cycle in graph using DFS
/*if(cycleCheckDFS(&g1))cout<<"Cycle is present"<<endl;
else cout<<"Cycle is not present"<<endl;
if(cycleCheckDFS(&g2))cout<<"Cycle is present"<<endl;
else cout<<"Cycle is not present"<<endl;*/
/*
Graph<int> g;
g.addEdge( 0, 1);
g.addEdge( 0, 4);
g.addEdge( 1, 2);
g.addEdge( 1, 3);
g.addEdge( 1, 4);
g.addEdge( 2, 3);
g.addEdge( 3, 4);
*/
//Depth First Search
//depthFirstSearch(&g);
//cout<<endl;
//Breadth First Search
//breadthFirstSearch(&g);
//cout<<endl;
// Print graph line by line such that each line contains node and all of its neighbours
//g.print();
return 0;
}
