[Question]: Usage of Graph Algorithms and Any Slowdowns?
Open
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 2.6k
- Forks
- 779
- Avg merge
- 1d 4h
- Merged PRs (30d)
- 27
Description
What kind of feature would you like to request?
Other?
Please describe your wishes
Hi there,
I'm interested in understanding if scanpy depends on any graph algorithms from its usage of NetworkX? If so,
- What algorithms are used for what purpose?
- What graph sizes are they being used with?
- Have users experienced any slowdowns or issues with algorithms provided by NetworkX? (Speed, algorithm availability, etc)
Furthermore, would users be interested in accelerated nx algorithms via a GPU backend? This would involve zero code change.
Any insight into this topic would be greatly appreciated! Thank you.
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 tracing scanpy's usage of NetworkX and identify which graph algorithms serve which purposes. Determine the graph sizes involved and gather evidence about slowdowns, algorithm availability, and interest in an accelerated GPU backend; done means a concise, evidence-based response to each question.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- bioinformatics, data
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100