Follow-ups for algorithms in GraphQL
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 642
- Forks
- 70
- Avg merge
- 2d 13h
- Merged PRs (30d)
- 21
Description
Missing algorithms:
temporal_bipartite_projection, kCore, and kCoreSet. They return graphs and it's possible that the graphs generated here are huge.
Modified algorithm:
temporal_rich_club_coefficient can't take an iterator of GraphViews in GraphQL. Instead, we take arguments for creating a rolling window and call the algorithm using that. As such, only rolling windows can be used for this algorithm in GraphQL.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by locating the GraphQL implementations or entry points for temporal_bipartite_projection, kCore, kCoreSet, and temporal_rich_club_coefficient. Review how rolling-window arguments are handled and verify that the three missing algorithms and the modified algorithm behave as described, including the limitation to rolling windows.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- graphql, rust
- Domain
- backend-api-design
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100