mirror of
https://github.com/UnickSoft/graphonline.git
synced 2026-06-17 14:22:02 +00:00
Fixed shrt path algorithm name for graphs with negative edges. Fix loader.
This commit is contained in:
@@ -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 ";
|
||||
|
||||
Reference in New Issue
Block a user