Skip to main content
6 votes

Pagerank in directed *acyclic* graphs (DAG)

As suggested by the comments (thanks!), the answer is positive and rather easy. We want to compute the pagerank of all vertices of a DAG (Directed Acyclic Graph) $G = (V,E)$ with $n$ vertices and $m$ ...
Matthieu Latapy's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible