Your program should read a symmetric matrix from a text file that describes weighted edges of an undirected, connected graph and find the MST that is saved in an output file as a sequence of edges of the MST. The program also displays the numbers of vertices and edges in the graph and the time spent to find its MST for each data structure used brute force search algorithms

You may create your own list data structures based on arrays. No STL or Java Collection or other collection framework can be used. In the part of the algorithm implementation, you should not use any library functions including maximal or minimal functions but create your own functions to operate on arrays.

The algorithm operates on a two-dimensional array that represents the weight matrix.

Program in C++, and brute force search algorithm for minimum spanning tree, which means search all possible paths and get the nearest path.