mirrors/graphonline
1
0
Fork 0
mirror of https://github.com/UnickSoft/graphonline.git synced 2026-04-16 21:30:08 +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

12
script/pages/editor/model/texts.js
View File

@@ -224,6 +224,12 @@ var g_length_is = "length is ";
var g_error = "Error";
var g_salesmanProblem = "Salesman Problem";
var g_noSolution = "The solution doesn't exist";
var g_shortestLoopIs = "The length of shortest possible loop is ";
var g_salesmanProblemPath = "Salesman Path Problem";
var g_shortestPathIs = "The length of shortest path is ";
function loadTexts()
{
g_textsSelectAndMove = document.getElementById("SelectAndMoveObject").innerHTML;
@@ -455,4 +461,10 @@ function loadTexts()
g_length_is = document.getElementById("lengthIs").innerHTML;
g_error = document.getElementById("error").innerHTML;
g_salesmanProblem = document.getElementById("salesmanProblem").innerHTML;
g_noSolution = document.getElementById("noSolution").innerHTML;
g_shortestLoopIs = document.getElementById("shortestLoopIs").innerHTML;
g_salesmanProblemPath = document.getElementById("salesmanProblemPath").innerHTML;
g_shortestPathIs = document.getElementById("shortestPathIs").innerHTML;
}