Added translation for algorithm names.

lang/el/home.php

@@ -183,4 +183,21 @@
     $g_lang["drag_select_group"] = "Μπορείτε να σύρετε την επιλεγμένη ομάδα. ";
     $g_lang["copy_select_group"] = "Αντιγραφή επιλεγμένης ομάδας";
     $g_lang["remove_select_group"] = "Διαγραφή επιλεγμένης ομάδας";
+
+    $g_lang["bfs_name"] = "Breadth-first search";
+    $g_lang["coloring_name"] = "Graph coloring";
+    $g_lang["find_connection_component_name"] = "Find connected components";
+    $g_lang["dfs_name"] = "Depth-first search";
+    $g_lang["eulerin_loop_name"] = "Find Eulerian cycle";
+    $g_lang["eulerin_path_name"] = "Find Eulerian path";
+    $g_lang["fiold_name"] = "Floyd–Warshall algorithm";
+    $g_lang["graph_reorder_name"] = "Arrange the graph";
+    $g_lang["hamiltoian_cycle_name"] = "Find Hamiltonian cycle";
+    $g_lang["hamiltonian_path_name"] = "Find Hamiltonian path";
+    $g_lang["max_flow_name"] = "Find Maximum flow";
+    $g_lang["minimum_spanning_tree"] = "Search of minimum spanning tree";
+    $g_lang["modern_graph_style_name"] = "Visualisation based on weight";
+    $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";
 ?>

lang/en/home.php

@@ -182,4 +182,21 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
     $g_lang["drag_select_group"] = "Drag group.";
     $g_lang["copy_select_group"] = "Copy group";
     $g_lang["remove_select_group"] = "Delete group";
+
+    $g_lang["bfs_name"] = "Breadth-first search";
+    $g_lang["coloring_name"] = "Graph coloring";
+    $g_lang["find_connection_component_name"] = "Find connected components";
+    $g_lang["dfs_name"] = "Depth-first search";
+    $g_lang["eulerin_loop_name"] = "Find Eulerian cycle";
+    $g_lang["eulerin_path_name"] = "Find Eulerian path";
+    $g_lang["fiold_name"] = "Floyd–Warshall algorithm";
+    $g_lang["graph_reorder_name"] = "Arrange the graph";
+    $g_lang["hamiltoian_cycle_name"] = "Find Hamiltonian cycle";
+    $g_lang["hamiltonian_path_name"] = "Find Hamiltonian path";
+    $g_lang["max_flow_name"] = "Find Maximum flow";
+    $g_lang["minimum_spanning_tree"] = "Search of minimum spanning tree";
+    $g_lang["modern_graph_style_name"] = "Visualisation based on weight";
+    $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";
 ?>

lang/es/home.php

@@ -182,4 +182,21 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
     $g_lang["drag_select_group"] = "Arrastrar grupo.";
     $g_lang["copy_select_group"] = "Copiar grupo";
     $g_lang["remove_select_group"] = "Borrar grupo";
+
+    $g_lang["bfs_name"] = "Breadth-first search";
+    $g_lang["coloring_name"] = "Graph coloring";
+    $g_lang["find_connection_component_name"] = "Find connected components";
+    $g_lang["dfs_name"] = "Depth-first search";
+    $g_lang["eulerin_loop_name"] = "Find Eulerian cycle";
+    $g_lang["eulerin_path_name"] = "Find Eulerian path";
+    $g_lang["fiold_name"] = "Floyd–Warshall algorithm";
+    $g_lang["graph_reorder_name"] = "Arrange the graph";
+    $g_lang["hamiltoian_cycle_name"] = "Find Hamiltonian cycle";
+    $g_lang["hamiltonian_path_name"] = "Find Hamiltonian path";
+    $g_lang["max_flow_name"] = "Find Maximum flow";
+    $g_lang["minimum_spanning_tree"] = "Search of minimum spanning tree";
+    $g_lang["modern_graph_style_name"] = "Visualisation based on weight";
+    $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";
 ?>

lang/fr/home.php

@@ -150,4 +150,21 @@
     $g_lang["drag_select_group"] = "Faites glisser le groupe.";
     $g_lang["copy_select_group"] = "Groupe de copie";
     $g_lang["remove_select_group"] = "Supprimer le groupe";
+
+    $g_lang["bfs_name"] = "Breadth-first search";
+    $g_lang["coloring_name"] = "Graph coloring";
+    $g_lang["find_connection_component_name"] = "Find connected components";
+    $g_lang["dfs_name"] = "Depth-first search";
+    $g_lang["eulerin_loop_name"] = "Find Eulerian cycle";
+    $g_lang["eulerin_path_name"] = "Find Eulerian path";
+    $g_lang["fiold_name"] = "Floyd–Warshall algorithm";
+    $g_lang["graph_reorder_name"] = "Arrange the graph";
+    $g_lang["hamiltoian_cycle_name"] = "Find Hamiltonian cycle";
+    $g_lang["hamiltonian_path_name"] = "Find Hamiltonian path";
+    $g_lang["max_flow_name"] = "Find Maximum flow";
+    $g_lang["minimum_spanning_tree"] = "Search of minimum spanning tree";
+    $g_lang["modern_graph_style_name"] = "Visualisation based on weight";
+    $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";
 ?>

lang/nl/home.php

@@ -147,4 +147,21 @@
     $g_lang["drag_select_group"] = "Sleep groep";
     $g_lang["copy_select_group"] = "Kopiëer groep";
     $g_lang["remove_select_group"] = "Verwijder groep";
+
+    $g_lang["bfs_name"] = "Breadth-first search";
+    $g_lang["coloring_name"] = "Graph coloring";
+    $g_lang["find_connection_component_name"] = "Find connected components";
+    $g_lang["dfs_name"] = "Depth-first search";
+    $g_lang["eulerin_loop_name"] = "Find Eulerian cycle";
+    $g_lang["eulerin_path_name"] = "Find Eulerian path";
+    $g_lang["fiold_name"] = "Floyd–Warshall algorithm";
+    $g_lang["graph_reorder_name"] = "Arrange the graph";
+    $g_lang["hamiltoian_cycle_name"] = "Find Hamiltonian cycle";
+    $g_lang["hamiltonian_path_name"] = "Find Hamiltonian path";
+    $g_lang["max_flow_name"] = "Find Maximum flow";
+    $g_lang["minimum_spanning_tree"] = "Search of minimum spanning tree";
+    $g_lang["modern_graph_style_name"] = "Visualisation based on weight";
+    $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";
 ?>

lang/ru/home.php

@@ -183,4 +183,21 @@
     $g_lang["drag_select_group"] = "Перемещайте группу.";
     $g_lang["copy_select_group"] = "Копировать";
     $g_lang["remove_select_group"] = "Удалить";
+
+    $g_lang["bfs_name"] = "Поиск в ширину";
+    $g_lang["coloring_name"] = "Раскраска графа";
+    $g_lang["find_connection_component_name"] = "Найти компоненты связности";
+    $g_lang["dfs_name"] = "Поиск в глубину";
+    $g_lang["eulerin_loop_name"] = "Найти Эйлеров цикл";
+    $g_lang["eulerin_path_name"] = "Найти Эйлерову цепь";
+    $g_lang["fiold_name"] = "Алгоритм Флойда — Уоршелла";
+    $g_lang["graph_reorder_name"] = "Упорядочить граф";
+    $g_lang["hamiltoian_cycle_name"] = "Найти Гамильтонов цикл";
+    $g_lang["hamiltonian_path_name"] = "Найти Гамильтонову цепь";
+    $g_lang["max_flow_name"] = "Поиск максимального потока";
+    $g_lang["minimum_spanning_tree"] = "Поиск минимального остовного дерева";
+    $g_lang["modern_graph_style_name"] = "Визуализация на основе весов";
+    $g_lang["radius_and_diameter_name"] = "Поиск радиуса и диаметра графа";
+    $g_lang["find_short_path_name"] = "Поиск кратчайший путь алгоритмом Дейкстры";
+    $g_lang["vertices_degree_name"] = "Рассчитать степень вершин";
 ?>