-
Notifications
You must be signed in to change notification settings - Fork 20.1k
Add DFS with parent-completion constraint for DAG traversal #6467
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
DenizAltunkapan
merged 9 commits into
TheAlgorithms:master
from
StathisVeinoglou:graph-dfs-parent-constraint
Aug 15, 2025
Merged
Add DFS with parent-completion constraint for DAG traversal #6467
DenizAltunkapan
merged 9 commits into
TheAlgorithms:master
from
StathisVeinoglou:graph-dfs-parent-constraint
Aug 15, 2025
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #6467 +/- ##
============================================
+ Coverage 75.10% 75.12% +0.02%
- Complexity 5556 5575 +19
============================================
Files 686 687 +1
Lines 19264 19318 +54
Branches 3719 3732 +13
============================================
+ Hits 14468 14513 +45
- Misses 4239 4244 +5
- Partials 557 561 +4 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
DenizAltunkapan
requested changes
Aug 14, 2025
src/main/java/com/thealgorithms/dynamicprogramming/PartitionProblem.java
Outdated
Show resolved
Hide resolved
alxkm
requested changes
Aug 14, 2025
…raightforward about the implementation.Added full names instead of shortcuts, and included record.
Thanks for all the suggestions! I believe that i implemented the changes. |
alxkm
approved these changes
Aug 15, 2025
DenizAltunkapan
approved these changes
Aug 15, 2025
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description
This PR adds a new
GraphTraversal
class that implements a modified DFS traversal order for directed graphs, ensuring that a node is only visited if all its parents have already been visited.This approach is useful in dependency resolution and neural network computation graph execution order.
clang-format -i --style=file path/to/your/file.java