Feat

[ananya-research]

No description provided.

[codecov-commenter]

Codecov Report

❌ Patch coverage is 76.66667% with 7 lines in your changes missing coverage. Please review.
✅ Project coverage is 75.77%. Comparing base (9484c7e) to head (3c55907).
⚠️ Report is 1 commits behind head on update-directory.

Files with missing lines	Patch %	Lines
.../main/java/com/thealgorithms/graph/ZeroOneBfs.java	76.66%	3 Missing and 4 partials ⚠️

Additional details and impacted files

@@                  Coverage Diff                   @@
##             update-directory    #6561      +/-   ##
======================================================
+ Coverage               75.75%   75.77%   +0.01%     
- Complexity               5772     5782      +10     
======================================================
  Files                     703      704       +1     
  Lines                   19777    19807      +30     
  Branches                 3832     3840       +8     
======================================================
+ Hits                    14982    15008      +26     
- Misses                   4215     4217       +2     
- Partials                  580      582       +2     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

[DenizAltunkapan]

The implementation looks good and correctly follows the 0–1 BFS algorithm. However, note that although BreadthFirstSearch and DepthFirstSearch are in com.thealgorithms.searches, this class logically belongs in com.thealgorithms.graph because it solves a shortest-path problem rather than a graph traversal. Its placement in the graph package is therefore appropriate and consistent with other shortest-path algorithms such as Dijkstra or Bellman–Ford.