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

This commit is contained in:
Oleg Sh
2024-08-03 21:03:42 +02:00
parent d628dcd74d
commit c9201526a9
25 changed files with 117 additions and 4369 deletions
+1
View File
@@ -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 BellmanFord'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 ";