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