Hi all, I've been reading the docs and have gotten more and more confused. Figure I better stop and ask for directions. So far, I've been successful in using the following (basically copied the connected component example): adjacency_list<vecS, vecS, undirectedS> G; vector<int> linkPath(num_vertices(G)); int num = connected_components(G, &linkPath[0]); cout << "Total number of linkPaths: " << num << endl; So from the output of the algorithm, I examine all the different paths found and are interested in certain vertices. For example, for some component, I want to know if a certain vertex has degrees over 2. I'm using undirected so I assume out_degree will give me the total degrees?
From the docs:
out_degree(vertex_descriptor u, const adjacency_list& g) and graph_traits<adjacency_list>::vertex_descriptor I think the 2nd param in out_degree is just G. But what about the first param? Is that like an iterator? how do I specify the vertex that I'm interested in? Thanks!