Change spanning tree calculations. Ignore orientation of edges.

lang/el/home.php

@@ -200,4 +200,8 @@
     $g_lang["radius_and_diameter_name"] = "Search graph radius and diameter";
     $g_lang["find_short_path_name"] = "Find shortest path using Dijkstra's algorithm";
     $g_lang["vertices_degree_name"] = "Calculate vertexes degree";
+
+    $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
+    $g_lang["min_spanning_tree_ignore_direction"] = "We ignored edges direction for calculation.";
+    $g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
 ?>

lang/en/home.php

@@ -199,4 +199,8 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
     $g_lang["radius_and_diameter_name"] = "Search graph radius and diameter";
     $g_lang["find_short_path_name"] = "Find shortest path using Dijkstra's algorithm";
     $g_lang["vertices_degree_name"] = "Calculate vertices degree";
+
+    $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
+    $g_lang["min_spanning_tree_ignore_direction"] = "We ignored edges direction for calculation.";
+    $g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
 ?>

lang/es/home.php

@@ -199,4 +199,8 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
     $g_lang["radius_and_diameter_name"] = "Buscar radio y diámetro del grafo";
     $g_lang["find_short_path_name"] = "Encontrar el camino más corto usando el algoritmo de Dijkstra";
     $g_lang["vertices_degree_name"] = "Calcular grado de los vértices";
+
+    $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
+    $g_lang["min_spanning_tree_ignore_direction"] = "We ignored edges direction for calculation.";
+    $g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
 ?>

lang/fr/home.php

@@ -167,4 +167,8 @@
     $g_lang["radius_and_diameter_name"] = "Calcul du rayon et du diamètre du graphe";
     $g_lang["find_short_path_name"] = "Plus court chemin avec l'algorithme de Dijkstra";
     $g_lang["vertices_degree_name"] = "Calculer le degré des sommets";
+
+    $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
+    $g_lang["min_spanning_tree_ignore_direction"] = "We ignored edges direction for calculation.";
+    $g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
 ?>

lang/nl/home.php

@@ -164,4 +164,8 @@
     $g_lang["radius_and_diameter_name"] = "Zoek grafiek straal en diameter";
     $g_lang["find_short_path_name"] = "Kortstepad-algoritme (Dijkstra's algoritme)";
     $g_lang["vertices_degree_name"] = "Bereken hoekpunten graden";
+
+    $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
+    $g_lang["min_spanning_tree_ignore_direction"] = "We ignored edges direction for calculation.";
+    $g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
 ?>

lang/ru/home.php

@@ -200,4 +200,8 @@
     $g_lang["radius_and_diameter_name"] = "Поиск радиуса и диаметра графа";
     $g_lang["find_short_path_name"] = "Поиск кратчайший путь алгоритмом Дейкстры";
     $g_lang["vertices_degree_name"] = "Рассчитать степень вершин";
+
+    $g_lang["min_spanning_tree_res_is"] = "Вес минимального оставного дерева равен ";
+    $g_lang["min_spanning_tree_ignore_direction"] = "Мы игнорировали ориентацию дуг при рассчете.";
+    $g_lang["min_spanning_tree_graph_not_connected"] = "Граф не является связным";
 ?>

lang/sv/home.php

@@ -162,4 +162,7 @@
     $g_lang["find_short_path_name"] = "Hitta den kortaste vägen med Dijkstras algoritm";
     $g_lang["vertices_degree_name"] = "Кäkna graden av vertikaler";
 
+    $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
+    $g_lang["min_spanning_tree_ignore_direction"] = "We ignored edges direction for calculation.";
+    $g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
 ?>