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

Added new wiki articles

Browse Source
This commit is contained in:
/usr/bin/nano
2020-02-08 13:00:25 +03:00
parent b659e2cd60
commit 7f4a5442ea
209 changed files with 592 additions and 184 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
en/wiki/wiki.d/Help.FindTheShortestPath Normal file → Executable file
View File

@@ -1,5 +1,5 @@
version=pmwiki-2.2.75 ordered=1 urlencoded=1
agent=Mozilla/5.0 (Macintosh; Intel Mac OS X 10_11_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/55.0.2883.87 Safari/537.36 OPR/42.0.2393.517
agent=Mozilla/5.0 (Macintosh; Intel Mac OS X 10_11_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/56.0.2924.87 Safari/537.36 OPR/43.0.2442.1165
author=
charset=UTF-8
csum=
@@ -7,11 +7,15 @@ ctime=1471451125
description=How to find the shortest path using Graph online
host=37.146.179.134
name=Help.FindTheShortestPath
rev=4
passwdedit=@lock
rev=6
targets=
text=(:Title Find the shortest path :)%0a(:Description How to find the shortest path using Graph online:)%0a%0a!! Searching algorithm%0a%0aGraph Online uses [[https://en.wikipedia.org/wiki/Dijkstra%2527s_algorithm|Dijkstra's algorithm]] for the shortest path search. The algorithm supports edges with integral and non-integral weights. %0a%0a!! How to use %0a%0a# Create a graph.%0a# Select "Find the shortest path" menu item.%0a# Select starting and finishing vertices.%0a%0aIf the path exists, it will be selected on the graph.%0a%0ahttp://images.unick-soft.ru/photos/share/2016_01_19_13_48_17.png%0a%0aMoreover, you may choose a detailed report. In that case the shortest path from the starting vertex to a stated one will be written above every vertex. On the contrary, if the vertex can not be approached from the starting vertex, there will be a "∞" symbol. %0a%0ahttp://images.unick-soft.ru/photos/share/2016_01_19_13_48_48.png
time=1485630964
title=Find the shortest path
time=1495230107
title=Find the shortest path
author:1495230084=
diff:1495230084:1485630964:=
host:1495230084=37.146.179.134
author:1485630964=
diff:1485630964:1471452535:=6c6%0a%3c Graph Online uses [[https://en.wikipedia.org/wiki/Dijkstra%2527s_algorithm|Dijkstra's algorithm]] for the shortest path search. The algorithm supports edges with integral and non-integral weights. %0a---%0a> Graph Online uses [[https://ru.wikipedia.org/wiki/Алгоритм_Дейкстры|алгоритмы Дейкстры]] for the shortest path search. The algorithm supports edges with integral and non-integral weights. %0a
host:1485630964=37.146.179.134