(Imported from Trac #183, reported by guest on 2007-11-22)
Google page rank is assigned to each page depening on (transitive) popularity. Something similar could be used to rank libraries, giving an indication of how central each library is in the haskell community.
Google page rank is described in http://en.wikipedia.org/wiki/PageRank
(Imported comment by @dcoutts on 2007-11-22)
the power method for calculating the first eigenvalue/vector of a (sparse) matrix. This is what Google Page Rank does.
(Imported comment by @dons on 2007-12-03)
there's a range of quality / popularity metrics we'd like to implement. Others include:
(Imported comment by guest on 2008-02-12)
Additional ideas for metrics:
I would say haddockness is more important than coverage, and coverage is more important than -Wall.
Closing as there's been no activity in years.
We're cleaning up the bug tracker to make it useful again and are thus closing bugs that haven't seen any activity in a long time. Please re-open (or file a new bug) if the problem reappears.