Add find all shortest pathes between two vertexes.

lang/bg/home.php

@@ -327,4 +327,7 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
     $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
     $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
     $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/ch/home.php

@@ -329,4 +329,7 @@
     $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
     $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
     $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/cs/home.php

@@ -328,4 +328,7 @@
     $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
     $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
     $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/de/home.php

@@ -286,4 +286,7 @@
     $g_lang["max_clique_not_found"] = "Max Clique is not found";
     $g_lang["max_clique_size_is"] = "Max Clique size is ";
     $g_lang["max_clique_contains"] = ". Clique contains these vertecies: "; 
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/el/home.php

@@ -325,4 +325,7 @@
     $g_lang["max_clique_not_found"] = "Max Clique is not found";
     $g_lang["max_clique_size_is"] = "Max Clique size is ";
     $g_lang["max_clique_contains"] = ". Clique contains these vertecies: "; 
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/en/home.php

@@ -330,4 +330,7 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
     $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
     $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
     $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/es/home.php

@@ -329,4 +329,7 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
     $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
     $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
     $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/fr/home.php

@@ -296,4 +296,7 @@
     $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
     $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
     $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/nl/home.php

@@ -293,4 +293,7 @@
     $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
     $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
     $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/pl/home.php

@@ -329,4 +329,7 @@ Dodaliśmy polskie tłumaczenie, Patryk</a>";
     $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
     $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
     $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/pt/home.php

@@ -294,4 +294,7 @@
     $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
     $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
     $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/ru/home.php

@@ -334,4 +334,7 @@
     $g_lang["max_independent_set_not_found"] = "Максимальное независимое множество не найдена";
     $g_lang["max_independent_set_size_is"] = "Размер Максимального независимого множества равен ";
     $g_lang["max_independent_set_contains"] = ". Множества содержит следующие вершины: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Найти все кратчайшие пути между вершинами";
+    $g_lang['number_of_shortest_pathes_from'] = "Количество кратчайших путей из ";
 ?>

lang/sv/home.php

@@ -285,4 +285,12 @@
     $g_lang['open_last_used_graph'] = "Open Recent Graph";
 
     $g_lang['vertex_name_place_holder'] = "vertex name";
+
+    $g_lang["max_independent_set"] = "Max Independent Set";
+    $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
+    $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
+    $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
+    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
 ?>

lang/ua/home.php

@@ -332,4 +332,7 @@
     $g_lang["max_independent_set_not_found"] = "Максимальное независимое множество не найдена";
     $g_lang["max_independent_set_size_is"] = "Размер Максимального независимого множества равен ";
     $g_lang["max_independent_set_contains"] = ". Множества содержит следующие вершины: ";
+
+    $g_lang['find_all_shortest_pathes'] = "Найти все кратчайшие пути между вершинами";
+    $g_lang['number_of_shortest_pathes_from'] = "Количество кратчайших путей из ";
 ?>