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

Fixed shrt path algorithm name for graphs with negative edges. Fix loader.

Browse Source
This commit is contained in:
Oleg Sh
2024-08-03 21:03:42 +02:00
parent d628dcd74d
commit c9201526a9
25 changed files with 117 additions and 4369 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -129,6 +129,7 @@ var g_minimumSpanningTree = "Search of minimum spanning tree";
var g_modernGraphStyleName = "Visualization based on weight";
var g_RadiusAndDiameter = "Search graph radius and diameter";
var g_findShortPathName = "Find shortest path using Dijkstra's algorithm";
var g_findShortPathBellmanFordName = "Find shortest path using Bellman–Ford algorithm";
var g_VerticesDegreeName = "Calculate vertices degree";
var g_SpanningTreeResult = "Min Spanning Tree is";
var g_SpanningTreeIgnoreDir = "We ignored edges direction for calculation";
@@ -340,6 +341,7 @@ function loadTexts()
g_modernGraphStyleName = document.getElementById("modernGraphStyleName").innerHTML;
g_RadiusAndDiameter = document.getElementById("RadiusAndDiameter").innerHTML;
g_findShortPathName = document.getElementById("findShortPathName").innerHTML;
g_findShortPathBellmanFordName = document.getElementById("findShortPathBellmanFordName").innerHTML;
g_VerticesDegreeName = document.getElementById("VerticesDegreeName").innerHTML;
g_SpanningTreeResult = document.getElementById("MinSpanningTreeResult").innerHTML;