Java Implementation: DFSrecursive with Graph class, Monotonic Array

[SlyyJavii]

• [x ] I have read CONTRIBUTING.md.
• [ x] This pull request is all my own work -- I have not plagiarized it.
• [ x] All filenames are in PascalCase.
• [ x] All functions and variable names follow Java naming conventions.
• [ x] All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• [ x] All new code is formatted with clang-format -i --style=file path/to/your/file.java

[codecov-commenter]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 73.54%. Comparing base (1c978c5) to head (41c8476).
Report is 210 commits behind head on master.

Additional details and impacted files

@@              Coverage Diff              @@
##             master    #6095       +/-   ##
=============================================
+ Coverage     62.98%   73.54%   +10.55%     
- Complexity     4049     5108     +1059     
=============================================
  Files           569      658       +89     
  Lines         16056    17649     +1593     
  Branches       3086     3396      +310     
=============================================
+ Hits          10113    12980     +2867     
+ Misses         5525     4166     -1359     
- Partials        418      503       +85     

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

[siriak]

DFS is already implemented here

Java/src/main/java/com/thealgorithms/searches/DepthFirstSearch.java

Line 13 in 1a2aedd

public class DepthFirstSearch<T> {

[SlyyJavii]

DFS is already implemented here

Java/src/main/java/com/thealgorithms/searches/DepthFirstSearch.java

Line 13 in 1a2aedd

public class DepthFirstSearch<T> {

My bad, on the website it doesn’t show that there was any java implementation for DFS

[siriak]

That's probably because it's not in data structures, but in searches. I think you could move the existing implementation to data structures to make it more discoverable