How to best improve results of an algorithm (get nodes and order in path)
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 729
- Forks
- 147
- Avg merge
- 19h
- Merged PRs (30d)
- 1
Description
Dear developers,
First; thank you for this library. Much leaner than boost :)
I use the Bellman Ford algorithm with negative edges to find the longest path in a directed graph. Great out of the box. For future work I would like to get the nodes that lie on the longest (or shortest) path. Think multiple jobs with (sequential) tasks on machines and finding the critical path. Might even get the delayed start times out as a result for all nodes.
I've been looking thru the source, and for starters I'm thinking of adding a vector of visited nodes or something to the results of the algorithm.
What would be the best way to work on this? Update the algorithm in the source code? Is there maybe a more general solution (already in the making)?
Best,
Bas
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 locating the Bellman-Ford implementation and its result type in the source. Determine how the library should expose longest or shortest path nodes, ordering, and delayed start times; completion would require an agreed API and corresponding implementation scope.
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