mirrors/graphonline
1
0
Fork 0
mirror of https://github.com/UnickSoft/graphonline.git synced 2026-02-16 02:30:51 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add Salesman Problem algorithms.

Browse Source
This commit is contained in:
Oleg Sh
2025-10-18 19:46:39 +02:00
parent 46c05d94fd
commit 31e676fd22
27 changed files with 386 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
lang/ch/home.php
View File

@@ -337,4 +337,10 @@
$g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
$g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
$g_lang['error'] = "Error";
$g_lang['salesman_problem'] = "Salesman Problem";
$g_lang['no_solution'] = "The solution doesn't exist";
$g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
$g_lang['salesman_path_problem'] = "Salesman Path Problem";
$g_lang['shortest_path_is'] = "The length of shortest path is ";
?>