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:
@@ -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 ";
|
||||
|
||||
Reference in New Issue
Block a user