@@ -31,14 +31,10 @@ int main() {
3131 // build bipartite graph with directed edge from left to right set
3232
3333/*
34- // Graph in Figure 4.40 can be built on the fly
34+ // Graph in Figure 4.37 can be built on the fly
3535 // we know there are 6 vertices in this bipartite graph, left side are numbered 0,1,2, right side 3,4,5
3636 int V = 6, Vleft = 3, set1[3] = {1,7,11}, set2[3] = {4,10,12};
3737
38- // Graph in Figure 4.41 can be built on the fly
39- // we know there are 5 vertices in this bipartite graph, left side are numbered 0,1, right side 3,4,5
40- //int V = 5, Vleft = 2, set1[2] = {1,7}, set2[3] = {4,10,12};
41-
4238 // build the bipartite graph, only directed edge from left to right is needed
4339 AL.assign(V, vi());
4440 for (int i = 0; i < Vleft; ++i)
@@ -47,7 +43,7 @@ int main() {
4743 AL[i].push_back(3 + j);
4844*/
4945
50- // For bipartite graph in Figure 4.44 , V = 5, Vleft = 3 (vertex 0 unused)
46+ // For bipartite graph in Figure 4.38 , V = 5, Vleft = 3 (vertex 0 unused)
5147 // AL[0] = {} // dummy vertex, but you can choose to use this vertex
5248 // AL[1] = {3, 4}
5349 // AL[2] = {3}
0 commit comments