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"] = "Рассчитать степень вершин";
 ?>

script/plugins/BFS.js

@@ -15,7 +15,7 @@ BFSAlgorithm.prototype.timerInterval = 500;
 
 BFSAlgorithm.prototype.getName = function(local)
 {
-    return local == "ru" ? "Поиск в ширину" : "Breadth-first search";
+    return g_BFSName;// local == "ru" ? "Поиск в ширину" : "Breadth-first search";
 }
 
 BFSAlgorithm.prototype.getId = function()

script/plugins/Coloring.js

@@ -19,7 +19,7 @@ Coloring.prototype = Object.create(BaseAlgorithm.prototype);
 
 Coloring.prototype.getName = function(local)
 {
-    return local == "ru" ? "Раскраска графа" : "Graph coloring";
+    return g_ColoringName; //local == "ru" ? "Раскраска графа" : "Graph coloring";
 }
 
 Coloring.prototype.getId = function()

script/plugins/ConnectedComponent.js

@@ -18,7 +18,7 @@ FindConnectedComponentNew.prototype = Object.create(BaseAlgorithm.prototype);
 
 FindConnectedComponentNew.prototype.getName = function(local)
 {
-    return local == "ru" ? "Найти компоненты связности" : "Find connected components";
+    return g_findConnectedComponent; //local == "ru" ? "Найти компоненты связности" : "Find connected components";
 }
 
 FindConnectedComponentNew.prototype.getId = function()

script/plugins/DFS.js

@@ -15,7 +15,7 @@ DFSAlgorithm.prototype.timerInterval = 500;
 
 DFSAlgorithm.prototype.getName = function(local)
 {
-    return local == "ru" ? "Поиск в глубину" : "Depth-first search";
+    return g_DFSName;// local == "ru" ? "Поиск в глубину" : "Depth-first search";
 }
 
 DFSAlgorithm.prototype.getId = function()

script/plugins/EulerianLoop.js

@@ -16,7 +16,7 @@ FindEulerianLoop.prototype = Object.create(BaseAlgorithmEx.prototype);
 
 FindEulerianLoop.prototype.getName = function(local)
 {
-    return local == "ru" ? "Найти Эйлеров цикл" : "Find Eulerian cycle";
+    return g_EulerinLoopName;//local == "ru" ? "Найти Эйлеров цикл" : "Find Eulerian cycle";
 }
 
 FindEulerianLoop.prototype.getId = function()

script/plugins/EulerianPath.js

@@ -16,7 +16,7 @@ FindEulerianPath.prototype = Object.create(BaseAlgorithmEx.prototype);
 
 FindEulerianPath.prototype.getName = function(local)
 {
-    return local == "ru" ? "Найти Эйлерову цепь" : "Find Eulerian path";
+    return g_EulerinPath;//local == "ru" ? "Найти Эйлерову цепь" : "Find Eulerian path";
 }
 
 FindEulerianPath.prototype.getId = function()

script/plugins/Floid.js

@@ -25,7 +25,7 @@ FloidAlgorithm.prototype.infinity = 1E8;
 
 FloidAlgorithm.prototype.getName = function(local)
 {
-    return local == "ru" ? "Алгоритм Флойда — Уоршелла" : "Floyd–Warshall algorithm";
+    return g_FloidName; //local == "ru" ? "Алгоритм Флойда — Уоршелла" : "Floyd–Warshall algorithm";
 }
 
 FloidAlgorithm.prototype.getId = function()

script/plugins/GraphReorder.js

@@ -19,7 +19,7 @@ GraphReorder.prototype = Object.create(BaseAlgorithm.prototype);
 
 GraphReorder.prototype.getName = function(local)
 {
-    return local == "ru" ? "Упорядочить граф" : "Arrange the graph";
+    return g_GraphReorder; //local == "ru" ? "Упорядочить граф" : "Arrange the graph";
 }
 
 GraphReorder.prototype.getId = function()

script/plugins/HamiltonianLoop.js

@@ -16,7 +16,7 @@ FindHamiltonianLoop.prototype = Object.create(BaseAlgorithmEx.prototype);
 
 FindHamiltonianLoop.prototype.getName = function(local)
 {
-    return local == "ru" ? "Найти Гамильтонов цикл" : "Find Hamiltonian cycle";
+    return g_HamiltoianCycleName; //local == "ru" ? "Найти Гамильтонов цикл" : "Find Hamiltonian cycle";
 }
 
 FindHamiltonianLoop.prototype.getId = function()

script/plugins/HamiltonianPath.js

@@ -16,7 +16,7 @@ FindHamiltonianPath.prototype = Object.create(BaseAlgorithmEx.prototype);
 
 FindHamiltonianPath.prototype.getName = function(local)
 {
-    return local == "ru" ? "Найти Гамильтонову цепь" : "Find Hamiltonian path";
+    return g_HamiltonianPath;//local == "ru" ? "Найти Гамильтонову цепь" : "Find Hamiltonian path";
 }
 
 FindHamiltonianPath.prototype.getId = function()

script/plugins/MaxFlow.js

@@ -27,7 +27,7 @@ FindMaxFlow.prototype.selectedEdges = null;
 
 FindMaxFlow.prototype.getName = function(local)
 {
-    return local == "ru" ? "Поиск максимального потока" : "Find Maximum flow";
+    return g_MaxFlowName; //local == "ru" ? "Поиск максимального потока" : "Find Maximum flow";
 }
 
 FindMaxFlow.prototype.getId = function()

script/plugins/MinimumSpanningTree.js

@@ -14,7 +14,7 @@ MinimumSpanningTree.prototype = Object.create(BaseAlgorithm.prototype);
 
 MinimumSpanningTree.prototype.getName = function(local)
 {
-    return local == "ru" ? "Поиск минимального остовного дерева" : "Search of minimum spanning tree";
+    return g_minimumSpanningTree; //local == "ru" ? "Поиск минимального остовного дерева" : "Search of minimum spanning tree";
 }
 
 MinimumSpanningTree.prototype.getId = function()

script/plugins/ModernGraphStyle.js

@@ -19,7 +19,7 @@ ModernGraphStyle.prototype = Object.create(BaseAlgorithm.prototype);
 
 ModernGraphStyle.prototype.getName = function(local)
 {
-    return local == "ru" ? "Визуализация на основе весов" : "Visualisation based on weight";
+    return g_modernGraphStyleName;// local == "ru" ? "Визуализация на основе весов" : "Visualisation based on weight";
 }
 
 ModernGraphStyle.prototype.getId = function()

script/plugins/RadiusAndDiameter.js

@@ -22,7 +22,7 @@ RadiusAndDiameter.prototype = Object.create(BaseAlgorithm.prototype);
 
 RadiusAndDiameter.prototype.getName = function(local)
 {
-    return local == "ru" ? "Поиск радиуса и диаметра графа": "Search graph radius and diameter";
+    return g_RadiusAndDiameter; //local == "ru" ? "Поиск радиуса и диаметра графа": "Search graph radius and diameter";
 }
 
 RadiusAndDiameter.prototype.getId = function()

script/plugins/ShortestPath.js

@@ -23,7 +23,7 @@ FindShortPathNew.prototype.infinityValue = 1E9 - 1;
 
 FindShortPathNew.prototype.getName = function(local)
 {
-    return local == "ru" ? "Поиск кратчайший путь алгоритмом Дейкстры" : "Find shortest path using Dijkstra's algorithm";
+    return g_findShortPathName; //local == "ru" ? "Поиск кратчайший путь алгоритмом Дейкстры" : "Find shortest path using Dijkstra's algorithm";
 }
 
 FindShortPathNew.prototype.getId = function()

script/plugins/VerticesDegree.js

@@ -16,7 +16,7 @@ VerticesDegree.prototype = Object.create(BaseAlgorithm.prototype);
 
 VerticesDegree.prototype.getName = function(local)
 {
-    return local == "ru" ? "Рассчитать степень вершин" : "Calculate vertexes degree";
+    return g_VerticesDegreeName; //local == "ru" ? "Рассчитать степень вершин" : "Calculate vertexes degree";
 }
 
 VerticesDegree.prototype.getId = function()

script/texts.js

@@ -112,6 +112,23 @@ var g_selectGroupText       = "Select using ctrl";
 var g_copyGroupeButton      = "Dublicate";
 var g_removeGroupeButton    = "Remove objects";
 
+var g_BFSName               = "Breadth-first search";   
+var g_ColoringName          = "Graph coloring";
+var g_findConnectedComponent = "Find connected components";
+var g_DFSName               = "Depth-first search";
+var g_EulerinLoopName       = "Find Eulerian cycle";
+var g_EulerinPath           = "Find Eulerian path";
+var g_FloidName             = "Floyd–Warshall algorithm";
+var g_GraphReorder          = "Arrange the graph";
+var g_HamiltoianCycleName   = "Find Hamiltonian cycle";
+var g_HamiltonianPath       = "Find Hamiltonian path";
+var g_MaxFlowName           = "Find Maximum flow";
+var g_minimumSpanningTree   = "Search of minimum spanning tree";
+var g_modernGraphStyleName  = "Visualisation based on weight";
+var g_RadiusAndDiameter     = "Search graph radius and diameter";
+var g_findShortPathName     = "Find shortest path using Dijkstra's algorithm";
+var g_VerticesDegreeName    = "Calculate vertexes degree";
+
 function loadTexts()
 {
 	g_textsSelectAndMove  = document.getElementById("SelectAndMoveObject").innerHTML;
@@ -230,4 +247,21 @@ function loadTexts()
     g_dragGroupText         = document.getElementById("dragSelectedGroup").innerHTML;
     g_copyGroupeButton      = document.getElementById("copySelectedGroup").innerHTML;
     g_removeGroupeButton    = document.getElementById("removeSelectedGroup").innerHTML;
+    
+    g_BFSName               = document.getElementById("BFSName").innerHTML; 
+    g_ColoringName          = document.getElementById("ColoringName").innerHTML;
+    g_findConnectedComponent = document.getElementById("findConnectedComponent").innerHTML;
+    g_DFSName               = document.getElementById("DFSName").innerHTML;
+    g_EulerinLoopName       = document.getElementById("EulerinLoopName").innerHTML;
+    g_EulerinPath           = document.getElementById("EulerinPath").innerHTML;
+    g_FloidName             = document.getElementById("FloidName").innerHTML;
+    g_GraphReorder          = document.getElementById("GraphReorder").innerHTML;
+    g_HamiltoianCycleName   = document.getElementById("HamiltoianCycleName").innerHTML;
+    g_HamiltonianPath       = document.getElementById("HamiltonianPath").innerHTML;
+    g_MaxFlowName           = document.getElementById("MaxFlowName").innerHTML;
+    g_minimumSpanningTree   = document.getElementById("minimumSpanningTree").innerHTML;
+    g_modernGraphStyleName  = document.getElementById("modernGraphStyleName").innerHTML;
+    g_RadiusAndDiameter     = document.getElementById("RadiusAndDiameter").innerHTML;
+    g_findShortPathName     = document.getElementById("findShortPathName").innerHTML;
+    g_VerticesDegreeName    = document.getElementById("VerticesDegreeName").innerHTML;
 }

tpl/home.php

@@ -163,7 +163,7 @@
     </div>
     </section>
 
-<? if (L('current_language') != "en"): ?>
+<? if (true || L('current_language') != "en"): ?>
 
     <section style="height:32px;text-align: center;" id="bottom_info" class="hidden-phone">
     <a class="ProgresssBarLink" href="opensource" target="_blank">
@@ -583,6 +583,23 @@
     <p id="copySelectedGroup" class="translation"><?= L('copy_select_group')?></p>
     <p id="removeSelectedGroup" class="translation"><?= L('remove_select_group')?></p>
         
+    <p id="BFSName" class="translation"><?= L('bfs_name')?></p>
+    <p id="ColoringName" class="translation"><?= L('coloring_name')?></p>
+    <p id="findConnectedComponent" class="translation"><?= L('find_connection_component_name')?></p>
+    <p id="DFSName" class="translation"><?= L('dfs_name')?></p>
+    <p id="EulerinLoopName" class="translation"><?= L('eulerin_loop_name')?></p>
+    <p id="EulerinPath" class="translation"><?= L('eulerin_path_name')?></p>
+    <p id="FloidName" class="translation"><?= L('fiold_name')?></p>
+    <p id="GraphReorder" class="translation"><?= L('graph_reorder_name')?></p>
+    <p id="HamiltoianCycleName" class="translation"><?= L('hamiltoian_cycle_name')?></p>
+    <p id="HamiltonianPath" class="translation"><?= L('hamiltonian_path_name')?></p>
+    <p id="MaxFlowName" class="translation"><?= L('max_flow_name')?></p>
+    <p id="minimumSpanningTree" class="translation"><?= L('minimum_spanning_tree')?></p>
+    <p id="modernGraphStyleName" class="translation"><?= L('modern_graph_style_name')?></p>
+    <p id="RadiusAndDiameter" class="translation"><?= L('radius_and_diameter_name')?></p>
+    <p id="findShortPathName" class="translation"><?= L('find_short_path_name')?></p>
+    <p id="VerticesDegreeName" class="translation"><?= L('vertices_degree_name')?></p>
+        
 </section>
 <!--
 <script>