kruskals_minimum_spanning_tree.cpp File Reference

Kruskals Minimum Spanning Tree implementation More...

#include <array>
#include <iostream>

Include dependency graph for kruskals_minimum_spanning_tree.cpp:

Namespaces
namespace	greedy_algorithms
	for std::vector

Functions
template<typename T >
void	greedy_algorithms::findMinimumEdge (const int &infinity, const std::array< std::array< T, 6 >, 6 > &graph)
	Finds the minimum edge of the given graph.
int	main ()
	Main function.

Detailed Description

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

Function Documentation

main()

int main

(

void

)

Main function.

Returns

0 on exit

           {
    constexpr int INFINITY = 99999;
    std::array<std::array<int, 6>, 6> graph{
        0,        4,        1,        4,        INFINITY, INFINITY,
        4,        0,        3,        8,        3,        INFINITY,
        1,        3,        0,        INFINITY, 1,        INFINITY,
        4,        8,        INFINITY, 0,        5,        7,
        INFINITY, 3,        1,        5,        0,        INFINITY,
        INFINITY, INFINITY, INFINITY, 7,        INFINITY, 0};
 
    greedy_algorithms::findMinimumEdge(INFINITY, graph);
    return 0;
}

Here is the call graph for this function: