-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
chore: add initial files for Minimum Spanning Tree algorithm
Rf #5
- Loading branch information
1 parent
220c876
commit 051ebb5
Showing
2 changed files
with
14 additions
and
0 deletions.
There are no files selected for viewing
This file contains 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,10 @@ | ||
# frozen_string_literal: true | ||
|
||
# Implementation of the algorithm found in: | ||
# https://www.geeksforgeeks.org/problem-solving-minimum-spanning-trees-kruskals-prims/ | ||
|
||
module AlgorithmsRuby | ||
class MinimumSpanning < Base | ||
|
||
end | ||
end |
This file contains 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,4 @@ | ||
# frozen_string_literal: true | ||
|
||
RSpec.describe AlgorithmsRuby::MinimumSpanning do | ||
end |