Current algorithms planned for implementation
Open
Nobody has claimed this yet.
Algorithms
Enhancement
Good first issue
Meta
- Dominant language
- Rust
- Stars
- 642
- Forks
- 70
- Avg merge
- 2d 13h
- Merged PRs (30d)
- 21
Description
Currently have several algorithms planned for implementation - as they get grabbed out of this list we can make a separate ticket for them and ref back here.
Vertex-specific algorithms:
- Single source shortest path
- In components
- out components
- Node redundancy
- Max flow
- Time respecting shortest path
- Edge independent paths (connectivity)
- Node independent paths (Connectivity)
- Local K-cliques
Global graph algorithms:
- Temporal Connected Components (temporal reachability)
- Eigen Centrality
- Maximum Quasi-Cliques
- Graph Diameter
- Strongly Connected Components
- Degree Centrality
- Katz Centrality
- Closeness Centrality
- Betweenness Centrality
- Random Walks + Graph embeddings
- Random-walk betweenness
- Graph Colouring
- Cycle inference (temporal + non)
- Cycle detection (temporal + non)
- K-cliques
- K-Core
- Bicomponents
- Tricomponents
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
No file, test, or entry point is named. Start by choosing one unchecked algorithm from the list and tracing the repository's existing graph-algorithm implementations; done should be a separate, scoped issue with defined behavior and validation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100