Contraction Hierarchies
Nobody has claimed this yet.
Assessment
- Difficulty
- 5/5
- Estimated time
- Over a week
- Newbie friendliness
- 25/100
Research direction
The issue names no files, tests, or entry points. Start by reading the linked contraction hierarchies overview and locating the library's existing shortest-path search implementation; done would require a defined contraction-hierarchies implementation and tests demonstrating shortest-path searches on large graphs.
Written by the indexing model from the issue text.
Description
What is the expected enhancement?
In order to perform shortest path searches on massive graphs, it would be quite useful to have some implementation of contraction hierarchies. https://en.wikipedia.org/wiki/Contraction_hierarchies
Is there any plan to implement this feature? Thank you!
- Dominant language
- Rust
- Stars
- 1.8k
- Forks
- 220
- Avg merge
- 3d 16h
- Merged PRs (30d)
- 3
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.
More from Qiskit/rustworkx
-
Difficulty 4/5 3-5 days Newbie friendliness 55/100
-
documentation
Difficulty 4/5 3-5 days Newbie friendliness 48/100
-
Difficulty 4/5 3-5 days Newbie friendliness 45/100
-
bug
Difficulty 3/5 1-2 days Newbie friendliness 65/100
-
Difficulty 4/5 3-5 days Newbie friendliness 48/100
All issues in Qiskit/rustworkx
Similar issues
-
Difficulty 2/5 1-3 hours Newbie friendliness 86/100
kwakseongjae/auto-hwp#319 ·
-
area:cli bug filter-quality good first issue priority:medium
Difficulty 2/5 1-3 hours Newbie friendliness 84/100
-
Difficulty 1/5 Under an hour Newbie friendliness 72/100
bevyengine/bevy#25861 ·
-
comp-datalake
Difficulty 2/5 1-3 hours Newbie friendliness 88/100
ClickHouse/ClickHouse#121222 ·
-
enhancement remote
Difficulty 2/5 1-3 hours Newbie friendliness 68/100