PageRank angorithm running on top of graph interface
emailtovamos opened this issue · comments
The idea is to have an underlying graph interface which can be implemented by multiple possible datastructures e.g. CSR graph or HAMT graph or simple map based graph.
The algorithm therefore should only use the pre-defined functions(functionalities) under the graph interface to run the PageRank algorithm.
This can be a starting point. Although it will require major changes. The key insight is:
- If a package is calling a lot of other packages vs if a package is being called by lot of other packages. Both are important. Not sure if equally important. This will need to be figured out by experimentation.