Hello to everyone,

I am trying to compute the Page Rank of the nodes of the Largest CC of the ‘cond-mat-2003’ graph. It seems like I am unable to compute them over only the Largest CC.

First, I extract the largest connected component:

   g  = collection.data[cond-mat-2003]

   l  = topology.label_largest_component(g)

g = GraphView(g, vfilt=l) OR g.set_vertex_filter(l)

And then calculate the PR 

   PR = centrality.pagerank(g, damping=0.99, epsilon=1e-06)

But,

The length of the PR.a is equal to the number of nodes of the whole graph and even more alarming, none of its entries is equal to zero.

This makes me suspect that PR is computed over the whole initial graph. Is this true?

Thanks a lot,

Panos