TheAlgorithms-C-Plus-Plus/greedy_algorithms/kruskals_minimum_spanning_tree.cpp

#include <iostream>
#include <array>

void findMinimumEdge(int INFINITY, std::array< std::array< int ,6 >,6 > graph) {
    for (int i = 0; i < graph.size(); i++) {
        int min = INFINITY;
        int minIndex = 0;
        for (int j = 0; j <  graph.size(); j++) {
            if (graph[i][j] != 0 && graph[i][j] < min) {
                min = graph[i][j];
                minIndex = j;
            }
        }
        std::cout << i << "  -  " << minIndex << "\t" << graph[i][minIndex] << std::endl;
    }
}

int main() {
    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};

    findMinimumEdge(INFINITY,graph);
    return 0;
}