microsoft / microsoft/Graphormer
[Feature Request] High Efficient Shortest Path Implementation
Open
enhancement
- Dominant language
- Python
- Stars
- 2.5k
- Forks
- 374
- PR merge metrics
- No merged PRs in 30d
Description
Summary
Calculation of shortest path on CPU would be the bottlenect when batchsize is small. High efficient implementation comparing to current Cython is desired.
Contributor guide
No contributing guide indexed for this repository
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 reviewing the current Cython shortest-path implementation and the linked pull request #78. Compare the CPU implementation's behavior and performance for small batch sizes, then define completion through a demonstrably more efficient shortest-path calculation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100