Now I get an input edge-list file for a bipartite graph. There are two columns of numbers, with each column representing one vertices set of the bipartite graph, let's say the first column is set A, and the second column is set B. The format of the file (the file is .txt format) is as follows:
Now I want to know exactly the component id for each vertex in set A and the corresponding component size. Because the igraph_cluster( )store the component id for each vertex in membership and the component size in csize, I need to pick out the component ids and corresponding size for vertices in set A from vector membership and component size. Before I can do this, I need pick out and record the vertices id in set A. So, I was trying to write a piece of code to do this for me, but I got stuck with this. Anyone gets some ideas about this? big thanks. by the way, I use c++.