giraph-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Paolo Castagna <castagna.li...@googlemail.com>
Subject Re: SimplePageRankVertex implementation, dangling nodes and sending messages to all nodes...
Date Mon, 28 May 2012 20:13:23 GMT
Hi Sebastian,
you can try yourself with some simple input (which contains dangling nodes).

For example, say I have this adjacency list (with mistakes/repetitions and
self-links, ignore those):

1 1 2 2
2 3 5 7 9 11
3 3 3 6
4
5 1 2 3 11
8 10
10 5

How many vertices? 7 or 11?

I think this graph has 11 and it's 11 you need to use as number of vertices
when you compute PageRank.

Paolo

Sebastian Schelter wrote:
> Hi Paolo,
> 
> Why would getNumVertices() not give back the correct number of vertices?
> This call should always give back the overall number of vertices (if it
> doesn't we have to fix it) and you shouldn't have to rely on tricks to
> count stuff via aggregators.
> 
> --sebastian



Mime
View raw message