Dijkstra based Critical Path compute algorithm
Open
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 729
- Forks
- 147
- Avg merge
- 19h
- Merged PRs (30d)
- 1
Description
Add Dijkstra based Critical Path compute algorithm
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 files, tests, or entry points are named. Start by locating the graph algorithm entry points and any existing Dijkstra implementation, then determine the expected definition and output of a critical-path computation. Done means the library provides the requested Dijkstra-based algorithm with behavior validated by appropriate tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100