diff --git a/d2/d90/namespacegreedy__algorithms.html b/d2/d90/namespacegreedy__algorithms.html
index 6e134cb1c..6232127ab 100644
--- a/d2/d90/namespacegreedy__algorithms.html
+++ b/d2/d90/namespacegreedy__algorithms.html
@@ -97,17 +97,84 @@ $(document).ready(function(){initNavTree('d2/d90/namespacegreedy__algorithms.htm
for std::vector
More...
+
for std::vector
for assert for INT_MAX for IO operations
Greedy Algorithms
-
+
+
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html
new file mode 100644
index 000000000..845d18c09
--- /dev/null
+++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html
@@ -0,0 +1,191 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: greedy_algorithms/kruskals_minimum_spanning_tree.cpp File Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+
+
+
+
+
Kruskals Minimum Spanning Tree implementation
+More...
+
#include <array>
+#include <iostream>
+
+
+
Kruskals Minimum Spanning Tree implementation
+
Quoted from Simplilearn .
+
Kruskal’s algorithm is the concept that is introduced in the graph theory of discrete mathematics. It is used to discover the shortest path between two points in a connected weighted graph. This algorithm converts a given graph into the forest, considering each node as a separate tree. These trees can only link to each other if the edge connecting them has a low value and doesn’t generate a cycle in MST structure.
+
Author coleman2246
+
+
+
◆ main()
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
57 {
+
58 constexpr int INFINITY = 99999;
+
+
60 0, 4, 1, 4, INFINITY, INFINITY,
+
61 4, 0, 3, 8, 3, INFINITY,
+
62 1, 3, 0, INFINITY, 1, INFINITY,
+
63 4, 8, INFINITY, 0, 5, 7,
+
64 INFINITY, 3, 1, 5, 0, INFINITY,
+
65 INFINITY, INFINITY, INFINITY, 7, INFINITY, 0};
+
66
+
+
68 return 0;
+
69 }
+
+
+
void findMinimumEdge(const int &infinity, const std::array< std::array< T, 6 >, 6 > &graph)
Finds the minimum edge of the given graph.
Definition kruskals_minimum_spanning_tree.cpp:36
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.js b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.js
new file mode 100644
index 000000000..b10509fb3
--- /dev/null
+++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.js
@@ -0,0 +1,5 @@
+var kruskals__minimum__spanning__tree_8cpp =
+[
+ [ "findMinimumEdge", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a127ce4403660032f53ae2e6467e5427d", null ],
+ [ "main", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ]
+];
\ No newline at end of file
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..d9b54ed45
--- /dev/null
+++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,5 @@
+
+
+
+
+
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..2c730e20b
--- /dev/null
+++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+e559ad5213eded0387c51a80dd5d5a2c
\ No newline at end of file
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..201e15995
--- /dev/null
+++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,65 @@
+
+
+
+
+
+
+
+
+
+
+
+main
+
+
+Node1
+
+
+main
+
+
+
+
+
+Node2
+
+
+greedy_algorithms::
+findMinimumEdge
+
+
+
+
+
+Node1->Node2
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
new file mode 100644
index 000000000..ecfb7f9cb
--- /dev/null
+++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
@@ -0,0 +1,40 @@
+
+
+
+
+
+
+main
+
+
+Node1
+
+
+main
+
+
+
+
+
+Node2
+
+
+greedy_algorithms::
+findMinimumEdge
+
+
+
+
+
+Node1->Node2
+
+
+
+
+
+
+
+
diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.map b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.map
new file mode 100644
index 000000000..35cfd1171
--- /dev/null
+++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.map
@@ -0,0 +1,7 @@
+
+
+
+
+
+
+
diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.md5 b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.md5
new file mode 100644
index 000000000..87774ddb0
--- /dev/null
+++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.md5
@@ -0,0 +1 @@
+68a97a0bb478e42de426b4b2bbfcef2a
\ No newline at end of file
diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg
new file mode 100644
index 000000000..35a986783
--- /dev/null
+++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg
@@ -0,0 +1,83 @@
+
+
+
+
+
+
+
+
+
+
+
+greedy_algorithms/kruskals_minimum_spanning_tree.cpp
+
+
+Node1
+
+
+greedy_algorithms/kruskals
+_minimum_spanning_tree.cpp
+
+
+
+
+
+Node2
+
+
+array
+
+
+
+
+
+Node1->Node2
+
+
+
+
+
+
+
+
+Node3
+
+
+iostream
+
+
+
+
+
+Node1->Node3
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg
new file mode 100644
index 000000000..47f9f76ac
--- /dev/null
+++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl_org.svg
@@ -0,0 +1,58 @@
+
+
+
+
+
+
+greedy_algorithms/kruskals_minimum_spanning_tree.cpp
+
+
+Node1
+
+
+greedy_algorithms/kruskals
+_minimum_spanning_tree.cpp
+
+
+
+
+
+Node2
+
+
+array
+
+
+
+
+
+Node1->Node2
+
+
+
+
+
+
+
+
+Node3
+
+
+iostream
+
+
+
+
+
+Node1->Node3
+
+
+
+
+
+
+
+
diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.html b/dir_0eaa691bd54ab0922ca7f50599de6d22.html
index 1917568cb..88b272ccb 100644
--- a/dir_0eaa691bd54ab0922ca7f50599de6d22.html
+++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.html
@@ -109,6 +109,9 @@ Files
jumpgame.cpp
Implementation of an algorithm to solve the jumping game problem.
+
kruskals_minimum_spanning_tree.cpp
+
Kruskals Minimum Spanning Tree implementation
+
diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.js b/dir_0eaa691bd54ab0922ca7f50599de6d22.js
index 93bbe0324..7bf9997fe 100644
--- a/dir_0eaa691bd54ab0922ca7f50599de6d22.js
+++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.js
@@ -1,5 +1,6 @@
var dir_0eaa691bd54ab0922ca7f50599de6d22 =
[
[ "boruvkas_minimum_spanning_tree.cpp", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp" ],
- [ "jumpgame.cpp", "df/d64/jumpgame_8cpp.html", "df/d64/jumpgame_8cpp" ]
+ [ "jumpgame.cpp", "df/d64/jumpgame_8cpp.html", "df/d64/jumpgame_8cpp" ],
+ [ "kruskals_minimum_spanning_tree.cpp", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html", "d8/d7d/kruskals__minimum__spanning__tree_8cpp" ]
];
\ No newline at end of file
diff --git a/files.html b/files.html
index efa868f26..dc3be146b 100644
--- a/files.html
+++ b/files.html
@@ -210,6 +210,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm