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
@@ -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 BellmanFord'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.";