Java
Java copied to clipboard
Feature/kruskal algorithm
This adds the Kruskal's Minimum Spanning Tree algorithm mentioned in #7067.
Description
Added the Kruskal algorithm and its corresponding unit tests using JUnit.
Implementation
- Complete Algorithm implementation
- Supporting Connected and Disconnected graphs.
- Time Complexity: O(e log e)
- Encapsulation
- JUnit Tests
-
For the expected behaviour
-
For edge cases
-
[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