mirrors/graphonline
1
0
Fork 0
mirror of https://github.com/UnickSoft/graphonline.git synced 2026-02-16 10:40:57 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update wiki-s

Browse Source
This commit is contained in:
/usr/bin/nano
2024-10-11 21:09:59 +03:00
parent 6ea3935543
commit 037d98a5eb
88 changed files with 5280 additions and 382 deletions
Download Patch File Download Diff File Expand all files Collapse all files

70
en/wiki/wiki.d/Help.BuildingGraphOfMinimalDistances Executable file → Normal file
View File

@@ -1,17 +1,75 @@
version=pmwiki-2.2.75 ordered=1 urlencoded=1
agent=Mozilla/5.0 (Macintosh; Intel Mac OS X 10_12_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/64.0.3282.186 Safari/537.36 OPR/51.0.2830.62
author=
agent=Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/116.0.0.0 Safari/537.36
author=ZAP
charset=UTF-8
csum=
csum=ZAP
ctime=1522844318
description=Building graph of minimal distances using the Floyd–Warshall algorithm Graph Online
host=37.146.182.20
host=188.255.35.115
name=Help.BuildingGraphOfMinimalDistances
rev=1
rev=17
targets=
text=(:Title Building graph of minimal distances:)%0a(:Description Building graph of minimal distances using the Floyd–Warshall algorithm Graph Online:)%0a%0a!! Graph of minimal distances%0a%0aThe graph of minimal distances is a graph which weight of the arch between two vertexes equals the minimal distance between the vertexes of the initial graph. An adjacency matrix of the graph of the minimal distances will be the matrix of the minimal distances of the initial graph.%0a%0a!! Searching algorithm%0a%0aWe use the Floyd–Warshall algorithm to find minimal distances between all the pairs of vertexes. %0a[[https://en.wikipedia.org/wiki/Floyd–Warshall_algorithm]]. %0a%0a!! How to use Floyd–Warshall algorithm%0a%0a* Choose “Algorithms” in the menu bar and then “The Floyd–Warshall algorithm”.%0a%0ahttp://graphonline.ru/wiki/uploads/Справка/minDistGraph.gif%0a%0a* If you want to work with a distance matrix, then push “Show distance matrix” button.%0a%0a* If you wish to save the result, then put a tick near the text “Press for saving”.
time=1522844318
time=1707847433
title=Building graph of minimal distances
author:1707847433=ZAP
csum:1707847433=ZAP
diff:1707847433:1707847399:minor=
host:1707847433=188.255.35.115
author:1707847399=cWindowssystemini
csum:1707847399=ZAP
diff:1707847399:1707847379:minor=
host:1707847399=188.255.35.115
author:1707847379=ZAP
csum:1707847379=c:/Windows/system.ini
diff:1707847379:1707847339:minor=
host:1707847379=188.255.35.115
author:1707847339=ZAP
csum:1707847339=ZAP
diff:1707847339:1707847303:minor=
host:1707847339=188.255.35.115
author:1707847303=ZAP
csum:1707847303=ZAP
diff:1707847303:1707847271:minor=
host:1707847303=188.255.35.115
author:1707847271=ZAP
csum:1707847271=ZAP
diff:1707847271:1707847231:minor=
host:1707847271=188.255.35.115
author:1707847231=ZAP
csum:1707847231=ZAP
diff:1707847231:1707847191:minor=
host:1707847231=188.255.35.115
author:1707847191=ZAP
csum:1707847191=ZAP
diff:1707847191:1707847176:minor=1,21d0%0a%3c (:Title Building graph of minimal distances:)%0a%3c (:Description Building graph of minimal distances using the Floyd–Warshall algorithm Graph Online:)%0a%3c %0a%3c !! Graph of minimal distances%0a%3c %0a%3c The graph of minimal distances is a graph which weight of the arch between two vertexes equals the minimal distance between the vertexes of the initial graph. An adjacency matrix of the graph of the minimal distances will be the matrix of the minimal distances of the initial graph.%0a%3c %0a%3c !! Searching algorithm%0a%3c %0a%3c We use the Floyd–Warshall algorithm to find minimal distances between all the pairs of vertexes. %0a%3c [[https://en.wikipedia.org/wiki/Floyd–Warshall_algorithm]]. %0a%3c %0a%3c !! How to use Floyd–Warshall algorithm%0a%3c %0a%3c * Choose “Algorithms” in the menu bar and then “The Floyd–Warshall algorithm”.%0a%3c %0a%3c http://graphonline.ru/wiki/uploads/Справка/minDistGraph.gif%0a%3c %0a%3c * If you want to work with a distance matrix, then push “Show distance matrix” button.%0a%3c %0a%3c * If you wish to save the result, then put a tick near the text “Press for saving”.%0a\ No newline at end of file%0a
host:1707847191=188.255.35.115
author:1707847176=ZAP
csum:1707847176=ZAP
diff:1707847176:1707847115:minor=0a1,21%0a> (:Title Building graph of minimal distances:)%0a> (:Description Building graph of minimal distances using the Floyd–Warshall algorithm Graph Online:)%0a> %0a> !! Graph of minimal distances%0a> %0a> The graph of minimal distances is a graph which weight of the arch between two vertexes equals the minimal distance between the vertexes of the initial graph. An adjacency matrix of the graph of the minimal distances will be the matrix of the minimal distances of the initial graph.%0a> %0a> !! Searching algorithm%0a> %0a> We use the Floyd–Warshall algorithm to find minimal distances between all the pairs of vertexes. %0a> [[https://en.wikipedia.org/wiki/Floyd–Warshall_algorithm]]. %0a> %0a> !! How to use Floyd–Warshall algorithm%0a> %0a> * Choose “Algorithms” in the menu bar and then “The Floyd–Warshall algorithm”.%0a> %0a> http://graphonline.ru/wiki/uploads/Справка/minDistGraph.gif%0a> %0a> * If you want to work with a distance matrix, then push “Show distance matrix” button.%0a> %0a> * If you wish to save the result, then put a tick near the text “Press for saving”.%0a\ No newline at end of file%0a
host:1707847176=188.255.35.115
author:1707847115=ZAP
csum:1707847115=ZAP
diff:1707847115:1707847084:minor=
host:1707847115=188.255.35.115
author:1707847084=ZAP
csum:1707847084=ZAP
diff:1707847084:1707847051:minor=
host:1707847084=188.255.35.115
author:1707847051=ZAP
csum:1707847051=ZAP
diff:1707847051:1707826645:minor=
host:1707847051=188.255.35.115
author:1707826645=ZAP
csum:1707826645=ZAP
diff:1707826645:1707826110:minor=
diff:1707826645:1707826645:minor=
host:1707826645=188.255.35.115
author:1707826110=ZAP
csum:1707826110=ZAP
diff:1707826110:1522844318:minor=
diff:1707826110:1707826110:minor=
host:1707826110=188.255.35.115
author:1522844318=
diff:1522844318:1522844318:=1,21d0%0a%3c (:Title Building graph of minimal distances:)%0a%3c (:Description Building graph of minimal distances using the Floyd–Warshall algorithm Graph Online:)%0a%3c %0a%3c !! Graph of minimal distances%0a%3c %0a%3c The graph of minimal distances is a graph which weight of the arch between two vertexes equals the minimal distance between the vertexes of the initial graph. An adjacency matrix of the graph of the minimal distances will be the matrix of the minimal distances of the initial graph.%0a%3c %0a%3c !! Searching algorithm%0a%3c %0a%3c We use the Floyd–Warshall algorithm to find minimal distances between all the pairs of vertexes. %0a%3c [[https://en.wikipedia.org/wiki/Floyd–Warshall_algorithm]]. %0a%3c %0a%3c !! How to use Floyd–Warshall algorithm%0a%3c %0a%3c * Choose “Algorithms” in the menu bar and then “The Floyd–Warshall algorithm”.%0a%3c %0a%3c http://graphonline.ru/wiki/uploads/Справка/minDistGraph.gif%0a%3c %0a%3c * If you want to work with a distance matrix, then push “Show distance matrix” button.%0a%3c %0a%3c * If you wish to save the result, then put a tick near the text “Press for saving”.%0a\ No newline at end of file%0a
host:1522844318=37.146.182.20