Fixed shrt path algorithm name for graphs with negative edges. Fix loader.

lang/bg/home.php

@@ -198,6 +198,7 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
     $g_lang["modern_graph_style_name"] = "Визуализация на база тегло";
     $g_lang["radius_and_diameter_name"] = "Намерете радиус и диаметър на граф";
     $g_lang["find_short_path_name"] = "Намерете най-краткия път с помощта на алгоритъма на Дейкстра";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Изчислете степента на връх";
 
     $g_lang["min_spanning_tree_res_is"] = "Теглото на минималното обхващащо дърво е ";

lang/ch/home.php

@@ -200,6 +200,7 @@
     $g_lang["modern_graph_style_name"] = "根据权重的可视化";
     $g_lang["radius_and_diameter_name"] = "找图的半径和直径";
     $g_lang["find_short_path_name"] = "用Dijkstra算法找最短路";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "计算顶点的度";
 
     $g_lang["min_spanning_tree_res_is"] = "最小生成树的权重是 ";

lang/cs/home.php

@@ -199,6 +199,7 @@
     $g_lang["modern_graph_style_name"] = "Vizualizace založená na váze";
     $g_lang["radius_and_diameter_name"] = "Hledání poloměru a průměru grafu";
     $g_lang["find_short_path_name"] = "Najít nejkratší cestu pomocí Dijkstrova algoritmu";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Výpočet stupňů vrcholů";
 
     $g_lang["min_spanning_tree_res_is"] = "Váha minimální kostry stromu je ";

lang/de/home.php

@@ -163,6 +163,7 @@
     $g_lang["modern_graph_style_name"] = "Gewicht-basierte Visualisierung";
     $g_lang["radius_and_diameter_name"] = "Graphradius und Graphdiameter suchen";
     $g_lang["find_short_path_name"] = "Kürzesten Weg via Dijkstra Algorithm finden";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Knotengewicht berechnen";
     $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
     $g_lang["min_spanning_tree_ignore_direction"] = "In time of calculation we have ignored the edges direction.";

lang/el/home.php

@@ -201,6 +201,7 @@
     $g_lang["modern_graph_style_name"] = "Απεικόνιση με βάση το βάρος";
     $g_lang["radius_and_diameter_name"] = "Αναζήτηση ακτίνας και διαμέτρου του γράφου";
     $g_lang["find_short_path_name"] = "Εύρεση συντομότερου μονοπατιού με χρήση του αλγορίθμου Dijkstra";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Υπολογισμός βαθμών κορυφών";
 
     $g_lang["min_spanning_tree_res_is"] = "Το βάρος του ελάχιστου ζευγνύοντος δέντρου είναι ";

lang/en/home.php

@@ -200,6 +200,8 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
     $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["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
+
     $g_lang["vertices_degree_name"] = "Calculate vertices degree";
 
     $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";

lang/es/home.php

@@ -200,6 +200,7 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
     $g_lang["modern_graph_style_name"] = "Visualización basada en el peso";
     $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["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Calcular grado de los vértices";
 
     $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";

lang/fr/home.php

@@ -167,6 +167,7 @@
     $g_lang["modern_graph_style_name"] = "Visualisation pondérée";
     $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["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Calculer le degré des sommets";
 
     $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";

lang/nl/home.php

@@ -164,6 +164,7 @@
     $g_lang["modern_graph_style_name"] = "Visualisatie op basis van gewicht";
     $g_lang["radius_and_diameter_name"] = "Zoek grafiek straal en diameter";
     $g_lang["find_short_path_name"] = "Kortstepad-algoritme (Dijkstra's algoritme)";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Bereken hoekpunten graden";
 
     $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";

lang/pl/home.php

@@ -200,6 +200,7 @@ Dodaliśmy polskie tłumaczenie, Patryk</a>";
     $g_lang["modern_graph_style_name"] = "Wizualizajca bazująca na wadze";
     $g_lang["radius_and_diameter_name"] = "Znajdź średnicę i cięciwe grafu";
     $g_lang["find_short_path_name"] = "Znajdź najkrótszą ścieżkę używając algiorytmu Dijkstra";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Policz stopień wierzchołków";
 
     $g_lang["min_spanning_tree_res_is"] = "Waga minimalnego drzewa rozpinającego to ";

lang/pt/home.php

@@ -166,6 +166,7 @@
     $g_lang["modern_graph_style_name"] = "Visualização baseada nos pesos";
     $g_lang["radius_and_diameter_name"] = "Buscar raio e diâmetro do grafo";
     $g_lang["find_short_path_name"] = "Encontrar o caminho mais curto usando o algoritmo de Dijkstra";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Calcular o grau dos vértices";
     $g_lang["min_spanning_tree_res_is"] = "Peso da árvore geradora mínima é";
     $g_lang["min_spanning_tree_ignore_direction"] = "Durante os cálculos ignoramos as direções dos vértices.";

lang/ru/home.php

@@ -201,6 +201,8 @@
     $g_lang["modern_graph_style_name"] = "Визуализация на основе весов";
     $g_lang["radius_and_diameter_name"] = "Поиск радиуса и диаметра графа";
     $g_lang["find_short_path_name"] = "Поиск кратчайший путь алгоритмом Дейкстры";
+    $g_lang["find_short_path_belman_ford_name"] = "Поиск кратчайший путь алгоритмом Беллмана-Форда";
+
     $g_lang["vertices_degree_name"] = "Рассчитать степень вершин";
 
     $g_lang["min_spanning_tree_res_is"] = "Вес минимального остовного дерева равен ";

lang/sv/home.php

@@ -161,6 +161,7 @@
     $g_lang["modern_graph_style_name"] = "Мiktbaserad visualisering";
     $g_lang["radius_and_diameter_name"] = "Hitta radien och diametern på en graf";
     $g_lang["find_short_path_name"] = "Hitta den kortaste vägen med Dijkstras algoritm";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Кäkna graden av vertikaler";
 
     $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";