iiitl / iiitl/chuck

Replace PageRank dict-of-dicts iteration in graph_analytics

Open
#6 13 comments 0 reactions 0 assignees View on GitHub
hard
Dominant language
Python
Stars
0
Forks
19
PR merge metrics
No merged PRs in 30d

Description

PageRank is currently a Python loop over a `dict` of node ranks for 16 iterations on 1,000 nodes.

Contributor guide

Open the contributing guide

Research direction

Locate the graph_analytics entry point and read the current PageRank implementation, focusing on the 16-iteration loop over the dict of node ranks. Compare its behavior on the stated 1,000-node case before changing it. Done means the dict-of-dicts iteration is replaced while PageRank results remain correct and the case is faster.

Written by the indexing model from the issue text.

Assessment

Tech stack
python
Domain
data, performance
Issue type
Refactor
Difficulty
4/5
Estimated time
3-5 days
Activity status
Quiet
Clarity
Mostly clear
Newbie friendliness
45/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.