mirror of
https://github.com/UnickSoft/graphonline.git
synced 2026-02-16 10:40:57 +00:00
Add Salesman Problem algorithms.
This commit is contained in:
File diff suppressed because one or more lines are too long
@@ -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;
|
||||
}
|
||||
@@ -721,6 +721,8 @@ Editor.prototype.createAlgorithmMenu = function()
|
||||
dialogClass: 'EdgeDialog',
|
||||
buttons: dialogButtons,
|
||||
});
|
||||
userAction("graph_to_big/" + algorithm.getId() + "/" + self.application.graph.vertices.length +
|
||||
"+vertices/" + self.application.graph.edges.length + "+edges");
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user