Add Salesman Problem algorithms.

lang/bg/home.php

@@ -335,4 +335,10 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/ch/home.php

@@ -337,4 +337,10 @@
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/cs/home.php

@@ -336,4 +336,10 @@
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/de/home.php

@@ -294,4 +294,10 @@
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/el/home.php

@@ -333,4 +333,10 @@
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/en/home.php

@@ -338,4 +338,10 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/es/home.php

@@ -337,4 +337,10 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/fr/home.php

@@ -304,4 +304,10 @@
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/nl/home.php

@@ -301,4 +301,10 @@
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/pl/home.php

@@ -337,4 +337,10 @@ Dodaliśmy polskie tłumaczenie, Patryk</a>";
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/pt/home.php

@@ -302,4 +302,10 @@
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/ru/home.php

@@ -342,4 +342,10 @@
     $g_lang['graph_is_to_large'] = "Граф слишком большой для этого алгоритма (<span id=\"current_graph_size\">X</span> вершин, <span id=\"current_edge_number\">X</span> дуг).";
     $g_lang['algorith_supports_max_limit'] = "Алгоритм поддерживает графы размером не больше <span id=\"algorithm_max_limit\">X</span> вершин и <span id=\"algorithm_edge_limit\">X</span> дуг.";
     $g_lang['error'] = "Ошибка";
+
+    $g_lang['salesman_problem'] = "Задача коммивояжёра";
+    $g_lang['no_solution'] = "Решения не существует";
+    $g_lang['shortest_loop_is'] = "Кратчайшие цикл имеет длинну ";
+    $g_lang['salesman_path_problem'] = "Задача коммивояжёра для пути";
+    $g_lang['shortest_path_is'] = "Кратчайшие путь имеет длинну ";
 ?>

lang/sv/home.php

@@ -298,4 +298,10 @@
     $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
     $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
     $g_lang['error'] = "Error";
+
+    $g_lang['salesman_problem'] = "Salesman Problem";
+    $g_lang['no_solution'] = "The solution doesn't exist";
+    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
+    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
+    $g_lang['shortest_path_is'] = "The length of shortest path is ";
 ?>

lang/ua/home.php

@@ -340,4 +340,10 @@
     $g_lang['graph_is_to_large'] = "Граф слишком большой для этого алгоритма (<span id=\"current_graph_size\">X</span> вершин, <span id=\"current_edge_number\">X</span> дуг).";
     $g_lang['algorith_supports_max_limit'] = "Алгоритм поддерживает графы размером не больше <span id=\"algorithm_max_limit\">X</span> вершин и <span id=\"algorithm_edge_limit\">X</span> дуг.";
     $g_lang['error'] = "Ошибка";
+
+    $g_lang['salesman_problem'] = "Задача коммивояжёра";
+    $g_lang['no_solution'] = "Решения не существует";
+    $g_lang['shortest_loop_is'] = "Кратчайшие цикл имеет длинну ";
+    $g_lang['salesman_path_problem'] = "Задача коммивояжёра для пути";
+    $g_lang['shortest_path_is'] = "Кратчайшие путь имеет длинну ";
 ?>