mirrors/graphonline
1
0
Fork 0
mirror of https://github.com/UnickSoft/graphonline.git synced 2026-04-07 00:06:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add algorithm to find all shortest paths from one vertex to another.

Browse Source
This commit is contained in:
Oleg Sh
2021-11-11 20:53:29 +02:00
parent dc6c90991e
commit 63a0cef6cc
13 changed files with 277 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
script/texts.js
View File

@@ -179,6 +179,11 @@ var g_pathN = "Path #";
var g_selectFinishVertex = "Select finish vertex";
var g_selectStartVertex = "Select start vertex";
// FindShortPatchsFromOne.js
var g_findAllPathesFromVertex = "Find all shortest paths from vertex";
var g_distanceFrom = "Distance from ";
var g_pathTo = "Path to ";
function loadTexts()
{
g_textsSelectAndMove = document.getElementById("SelectAndMoveObject").innerHTML;
@@ -365,4 +370,9 @@ function loadTexts()
g_pathN = document.getElementById("PathN").innerHTML;
g_selectFinishVertex = document.getElementById("SelectFinishVertex").innerHTML;
g_selectStartVertex = document.getElementById("SelectStartVertex").innerHTML;
// FindShortPatchsFromOne.js
g_findAllPathesFromVertex = document.getElementById("findAllPathsFromVertex").innerHTML;
g_distanceFrom = document.getElementById("distanceFrom").innerHTML;
g_pathTo = document.getElementById("pathTo").innerHTML;
}