Make prims's algorithm to return result

Author: baatochan

UndirectedGraph.cpp

@@ -147,7 +147,7 @@ void UndirectedGraph::loadRawDataToList(std::vector<int> rawData) {
 
 // private
 
-void UndirectedGraph::primsAlgorithmOnMatrix() {
+string UndirectedGraph::primsAlgorithmOnMatrix() {
 	// prepare vector for output
 	vector<vector<int>> minimumSpanningTree;
 	int numberOfVertices = incidenceMatrix[0].size();
@@ -211,6 +211,11 @@ void UndirectedGraph::primsAlgorithmOnMatrix() {
 	if (foundVertices.size() < numberOfVertices)
 		throw "Graf niespojny!";
 
+	string output = "Minimalne drzewo rozpinajace\n";
+
+	output += printMatrix(minimumSpanningTree);
+
+	return output;
 }
 
 void UndirectedGraph::primsAlgorithmOnList() {

UndirectedGraph.h

@@ -25,7 +25,7 @@ class UndirectedGraph : public Graph {
 	void loadRawDataToList(std::vector<int> rawData) override ;
 
 private:
-	void primsAlgorithmOnMatrix();
+	std::string primsAlgorithmOnMatrix();
 	void primsAlgorithmOnList();
 
 };