Re: [igraph] page.rank

[Gabor Csardi]

We simply consider an undirected graph as a directed one with mutual
edges. The justification is that it can be done. Calculating 
pagerank means solving an eigenvector problem and it does not matter
whether the matrix is symmetric (=undirected graph) or not.

Now, the interpretation of the results is a different question.
But this is not igraph's business.

Gabor

On Thu, Mar 06, 2008 at 07:25:39PM +0900, MATSUDA, Noriyuki wrote:
> Hello:
> 
>   PageRank in igraph can treat undirected graph, though the algorithm 
> was initially defined for directed one.  I'd like to know how igraph 
> make it possible and the justification behind it.
> 
> Thanks in advance.
> -- 
> MATSUDA, Noriyuki　<in Kanji> 松田 紀之
> 
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

-- 
Csardi Gabor <address@hidden>    UNIL DGM