-
I like your idea. I was using Networkx and it just hogs all memory, I was looking for a python graph library for large graphs and I saw this library.
Can future enhancements support Graph Algorith…
-
Hi, I am new to Timely Dataflow
I am so impressed by the design philosophy of Timely Dataflow.
Currently, I am investigating the performance impact of its asynchronous execution engine on
for s…
-
The goal of this issue is to serve as an overview of possible future examples or calculations that we could include in this repository or in the appendix of the extended paper.
I created this list …
-
This is a feature request for a special karma system for oftn-bot which uses an algorithm similar to the PageRank™ algorithm used in Google searches. People with more karma will have more influence in…
-
### Description
We now like the openRank algorithm very much and hope to use the openRank algorithm to implement an integration system: [KToken](https://github.com/kaiyuanshe/KToken).
I don't k…
-
When I run your algorithm Pagerank , I have some trouble about the structure of input file. I want to test the SNAPS datasets which is supported by the project namely SNAP. But It seems that your prog…
-
Depends on #31
Implement the incremental pagerank approach as suggested by the whitepaper.
The first step should be to further spec out the algorithm and its implementation in the data model doc…
-
The new JoinFunction does not provide a collector for the output. In some cases it could be beneficial to have such an collector as in the previous API. I propose to create an additional function (nam…
-
The implementation of the [PageRank algorithm](https://en.wikipedia.org/wiki/PageRank) calc method in `src/main/java/com/thealgorithms/others/PageRank.java` has reported cyclomatic complexity 13 by [l…
-
I am using NodeJS to trigger the pagerank algorithm. I understand once I end up with a ton of nodes and edges that it could take some time, but I wanted to have an automated way of determining when th…