mirror of
https://github.com/UnickSoft/graphonline.git
synced 2026-06-15 21:30:56 +00:00
Added new wiki articles
This commit is contained in:
/usr/bin/nano
Executable
+16
@@ -0,0 +1,16 @@
|
||||
version=pmwiki-2.2.75 ordered=1 urlencoded=1
|
||||
agent=Mozilla/5.0 (Windows NT 6.1; WOW64; rv:41.0) Gecko/20100101 Firefox/41.0
|
||||
author=Johnette
|
||||
charset=UTF-8
|
||||
csum=UVvCXeSM
|
||||
ctime=1499557594
|
||||
host=46.161.14.99
|
||||
name=Cookbook.Cookbook
|
||||
rev=1
|
||||
targets=
|
||||
text=Walking in the precnese of giants here. Cool thinking all around!
|
||||
time=1499557594
|
||||
author:1499557594=Johnette
|
||||
csum:1499557594=UVvCXeSM
|
||||
diff:1499557594:1499557594:=1d0%0a%3c Walking in the precnese of giants here. Cool thinking all around!%0a\ No newline at end of file%0a
|
||||
host:1499557594=46.161.14.99
|
||||
Executable
+9
@@ -0,0 +1,9 @@
|
||||
version=pmwiki-2.2.75 ordered=1 urlencoded=1
|
||||
agent=Mozilla/5.0 (Windows NT 6.1; WOW64; rv:41.0) Gecko/20100101 Firefox/41.0
|
||||
charset=UTF-8
|
||||
ctime=1499557594
|
||||
host=46.161.14.99
|
||||
name=Cookbook.RecentChanges
|
||||
rev=1
|
||||
text=* [[Cookbook/Cookbook]] . . . July 09, 2017, at 02:46 AM by [[~Johnette]]: [=UVvCXeSM=]%0a
|
||||
time=1499557594
|
||||
Regular → Executable
+13
-7
@@ -1,15 +1,21 @@
|
||||
version=pmwiki-2.2.75 ordered=1 urlencoded=1
|
||||
agent=Mozilla/5.0 (Windows NT 6.1; WOW64; rv:41.0) Gecko/20100101 Firefox/41.0
|
||||
author=Reignbeau
|
||||
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=gXjrEFBE1tDp
|
||||
csum=
|
||||
ctime=1484903689
|
||||
host=188.143.232.32
|
||||
description=API documentation about creating own algorithm for GraphOnline.ru.
|
||||
host=37.146.179.134
|
||||
name=Development.Development
|
||||
rev=3
|
||||
passwdedit=@lock
|
||||
rev=5
|
||||
targets=
|
||||
text=A %3ca href="http://euysewom.com">plelsingay%3c/a> rational answer. Good to hear from you.
|
||||
time=1485188281
|
||||
text=(:Title Documentation about creating of algorithm :)%0a(:Description API documentation about creating own algorithm for GraphOnline.ru.:)%0a%0a!! Documentation about creating of algorithm Graphonline%0a%0aFull documentation you can download using this link [[Attach: GraphonlineAPI10En.pdf|documentaion]].
|
||||
time=1495230452
|
||||
title=Documentation about creating of algorithm
|
||||
author:1495230452=
|
||||
diff:1495230452:1495230397:=1,6c1%0a%3c (:Title Documentation about creating of algorithm :)%0a%3c (:Description API documentation about creating own algorithm for GraphOnline.ru.:)%0a%3c %0a%3c !! Documentation about creating of algorithm Graphonline%0a%3c %0a%3c Full documentation you can download using this link [[Attach: GraphonlineAPI10En.pdf|documentaion]].%0a\ No newline at end of file%0a---%0a> A %3ca href="http://euysewom.com">plelsingay%3c/a> rational answer. Good to hear from you.%0a\ No newline at end of file%0a
|
||||
host:1495230452=37.146.179.134
|
||||
author:1485188281=Reignbeau
|
||||
csum:1485188281=gXjrEFBE1tDp
|
||||
diff:1485188281:1485015965:=1c1%0a%3c A %3ca href="http://euysewom.com">plelsingay%3c/a> rational answer. Good to hear from you.%0a\ No newline at end of file%0a---%0a> I %3ca href="http://jmawzxk.com">secahred%3c/a> a bunch of sites and this was the best.%0a\ No newline at end of file%0a
|
||||
|
||||
Regular → Executable
+6
-5
@@ -1,17 +1,18 @@
|
||||
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/52.0.2743.116 Safari/537.36 OPR/39.0.2256.71
|
||||
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=
|
||||
ctime=1473362491
|
||||
description=API documentation about creating own algorithm for GraphOnline.ru.
|
||||
host=82.145.220.103
|
||||
host=37.146.179.134
|
||||
name=Development.Documentation
|
||||
rev=6
|
||||
passwdedit=@lock
|
||||
rev=7
|
||||
targets=
|
||||
text=(:Title Documentation about creating of algorithm :)%0a(:Description API documentation about creating own algorithm for GraphOnline.ru.:)%0a%0a!! Documentation about creating of algorithm Graphonline%0a%0aFull documentation you can download using this link [[Attach: GraphonlineAPI10En.pdf|documentaion]].
|
||||
time=1473520488
|
||||
title=Documentation about creating of algorithm
|
||||
time=1495230366
|
||||
title=Documentation about creating of algorithm
|
||||
author:1473520488=
|
||||
diff:1473520488:1473362816:=2c2%0a%3c (:Description API documentation about creating own algorithm for GraphOnline.ru.:)%0a---%0a> (:Summary: API documentation about creating own algorithm for GraphOnline.ru.:)%0a
|
||||
host:1473520488=82.145.220.103
|
||||
|
||||
Regular → Executable
+5
-5
@@ -1,15 +1,15 @@
|
||||
version=pmwiki-2.2.75 ordered=1 urlencoded=1
|
||||
agent=Mozilla/5.0 (Windows NT 6.1; WOW64; rv:41.0) Gecko/20100101 Firefox/41.0
|
||||
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=Katty
|
||||
charset=UTF-8
|
||||
csum=PpJVaiFJ8C
|
||||
ctime=1473362491
|
||||
host=188.143.232.32
|
||||
host=37.146.179.134
|
||||
name=Development.RecentChanges
|
||||
rev=15
|
||||
rev=16
|
||||
targets=
|
||||
text=Heck yeah this is %3ca href="http://tvuqimcbw.com">exlcaty%3c/a> what I needed.* [[Development/RecentChanges]] . . . January 23, 2017, at 07:20 PM by [[~Katty]]: [=PpJVaiFJ8C=]%0a
|
||||
time=1485188417
|
||||
text=* [[Development/Development]] . . . May 20, 2017, at 12:47 AM by ?: [==]%0aHeck yeah this is %3ca href="http://tvuqimcbw.com">exlcaty%3c/a> what I needed.* [[Development/RecentChanges]] . . . January 23, 2017, at 07:20 PM by [[~Katty]]: [=PpJVaiFJ8C=]%0a
|
||||
time=1495230452
|
||||
author:1485188417=Katty
|
||||
csum:1485188417=PpJVaiFJ8C
|
||||
diff:1485188417:1485188281:=1c1,2%0a%3c Heck yeah this is %3ca href="http://tvuqimcbw.com">exlcaty%3c/a> what I needed.%0a\ No newline at end of file%0a---%0a> * [[Development/Development]] . . . January 23, 2017, at 07:18 PM by [[~Reignbeau]]: [=gXjrEFBE1tDp=]%0a> Super %3ca href="http://ytzcat.com">exicted%3c/a> to see more of this kind of stuff online.* [[Development/RecentChanges]] . . . January 21, 2017, at 07:28 PM by [[~Lolly]]: [=APNNaPV6rB2s=]%0a
|
||||
|
||||
Regular → Executable
+5
-4
@@ -1,16 +1,17 @@
|
||||
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/52.0.2743.82 Safari/537.36 OPR/39.0.2256.48
|
||||
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=
|
||||
ctime=1470437183
|
||||
description=How to add directed line to Graph Online
|
||||
host=128.68.33.133
|
||||
host=37.146.179.134
|
||||
name=Help.AddDirectedLine
|
||||
rev=3
|
||||
passwdedit=@lock
|
||||
rev=4
|
||||
targets=
|
||||
text=(:Title Add Directed Line:)%0a(:Description How to add directed line to Graph Online:)%0a%0a!!! Directed Line%0a%0aDirected line connects vertices. Directed line may have weight or could be unweighted. Directed lines can be directed graph and ordinary (undirected) graph.%0a%0a%0a!!! How to add directed line%0a%0aIn order to add a directed line you have to choose "Connect vertices" in the menu bar. Then you should select starting vertex and click on the finishing vertex. Thus, you will see the table:%0a%0ahttp://images.unick-soft.ru/photos/share/create_edge.png%0a%0aYou can enter the weight of the directed line or choose unweighted edge. Then you have to click on the "Oriented" or "Non-oriented" button to create the directed line, which corresponds to your demand.%0a%0aVarious types of directed lines:%0a%0ahttp://images.unick-soft.ru/photos/share/edges_types.png%0a%0a!!! How to erase a directed line%0a%0aIn order to delete a directed line you have to click on "Delete" button and then click on a directed line. %0a
|
||||
time=1471028803
|
||||
time=1495230302
|
||||
title=Add Directed Line
|
||||
author:1471028803=
|
||||
diff:1471028803:1470942694:=6,8c6,8%0a%3c Directed line connects vertices. Directed line may have weight or could be unweighted. Directed lines can be directed graph and ordinary (undirected) graph.%0a%3c %0a%3c %0a---%0a> Directed line connects vertices. Directed line may have weight or could be non-weighted. Directed lines can be directed graph and ordinary (undirected) graph.%0a> %0a> %0a15c15%0a%3c You can enter the weight of the directed line or choose unweighted edge. Then you have to click on the "Oriented" or "Non-oriented" button to create the directed line, which corresponds to your demand.%0a---%0a> You can enter the weight of the directed line or choose non-weighted edge. Then you have to click on the "Oriented" or "Non-oriented" button to create the directed line, which corresponds to your demand.%0a
|
||||
|
||||
Regular → Executable
+5
-4
@@ -1,16 +1,17 @@
|
||||
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/52.0.2743.82 Safari/537.36 OPR/39.0.2256.48
|
||||
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=
|
||||
ctime=1470412431
|
||||
description=How to add a vertex in Graph Online
|
||||
host=128.68.33.133
|
||||
host=37.146.179.134
|
||||
name=Help.AddVertex
|
||||
rev=2
|
||||
passwdedit=@lock
|
||||
rev=3
|
||||
targets=
|
||||
text=(:Title Add vertex:)%0a(:Description How to add a vertex in Graph Online:)%0a%0a!!! Vertex%0a%0aA graph consists of vertices and edges. Edges connect vertices. Usually vertices have their own label or name. Occasionally vertices may be distinguished by colour, for instance while painting the graph.%0a%0a!!! How to add vertices%0a%0aIn order to add vertices you have to select "Add vertex" in the menu bar and click on the work area where you want to place a vertex.%0a%0a%0aIf you add new vertices in the adjacency matrix or incidence matrix, then they will appear in the working area. %0a%0a!!! Vertices enumeration%0a%0aIn the help window you may choose how to index the vertices. There are 4 types:%0a%0a%0a# 1, 2, 3... - numbers.%0a# A, B, C... - in Latin letters.%0a# А, Б, В... - in Cyrillic letters.%0a# Α, Β, Γ, Δ... - in Greek letters.
|
||||
time=1470941362
|
||||
time=1495230281
|
||||
title=Add vertex
|
||||
author:1470941362=
|
||||
diff:1470941362:1470412431:=6,7c6,7%0a%3c A graph consists of vertices and edges. Edges connect vertices. Usually vertices have their own label or name. Occasionally vertices may be distinguished by colour, for instance while painting the graph.%0a%3c %0a---%0a> A graph consists of vertices and directed lines. Directed lines connect vertices. Usually vertices have their own label or name. Occasionally vertices may be distinguished by colour, for instance while painting the graph.%0a> %0a10c10%0a%3c In order to add vertices you have to select "Add vertex" in the menu bar and click on the work area where you want to place a vertex.%0a---%0a> In order to add vertices you have to select "Add vertex" in the menu bar and click on the work are where you'd line to place a vertex.%0a
|
||||
|
||||
Regular → Executable
+5
-4
File diff suppressed because one or more lines are too long
+17
@@ -0,0 +1,17 @@
|
||||
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=
|
||||
charset=UTF-8
|
||||
csum=
|
||||
ctime=1522844318
|
||||
description=Building graph of minimal distances using the Floyd–Warshall algorithm Graph Online
|
||||
host=37.146.182.20
|
||||
name=Help.BuildingGraphOfMinimalDistances
|
||||
rev=1
|
||||
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
|
||||
title=Building graph of minimal distances
|
||||
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
|
||||
Executable
+17
@@ -0,0 +1,17 @@
|
||||
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=
|
||||
charset=UTF-8
|
||||
csum=
|
||||
ctime=1522849817
|
||||
description=Calculate vertexes degree with Graph Online
|
||||
host=37.146.182.20
|
||||
name=Help.CalculateVertexesDegree
|
||||
rev=1
|
||||
targets=
|
||||
text=(:Title Calculate vertexes degree:)%0a(:Description Calculate vertexes degree with Graph Online:)%0a%0a!!! Vertexes degree%0a%0aVertexes degree for undirected graph is the number of arches entering or coming from the vertex.%0a%0aFor directed graph Graph Online will calculate the number of arches coming from the vertex.%0a%0aIn order to use the algorithm choose “Algorithms” in the menu bar and then “Calculate vertexes degree”%0a%0ahttp://graphonline.ru/wiki/uploads/Справка/vertex_degree.gif%0a%0aVertexes degree will appear above every vertex. The vertexes of the same degree will be of the same colour.
|
||||
time=1522849817
|
||||
title=Calculate vertexes degree
|
||||
author:1522849817=
|
||||
diff:1522849817:1522849817:=1,14d0%0a%3c (:Title Calculate vertexes degree:)%0a%3c (:Description Calculate vertexes degree with Graph Online:)%0a%3c %0a%3c !!! Vertexes degree%0a%3c %0a%3c Vertexes degree for undirected graph is the number of arches entering or coming from the vertex.%0a%3c %0a%3c For directed graph Graph Online will calculate the number of arches coming from the vertex.%0a%3c %0a%3c In order to use the algorithm choose “Algorithms” in the menu bar and then “Calculate vertexes degree”%0a%3c %0a%3c http://graphonline.ru/wiki/uploads/Справка/vertex_degree.gif%0a%3c %0a%3c Vertexes degree will appear above every vertex. The vertexes of the same degree will be of the same colour. %0a\ No newline at end of file%0a
|
||||
host:1522849817=37.146.182.20
|
||||
Regular → Executable
+5
-4
@@ -1,16 +1,17 @@
|
||||
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/52.0.2743.82 Safari/537.36 OPR/39.0.2256.48
|
||||
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=
|
||||
ctime=1471353416
|
||||
description=How to drag and drop vertices in Graph Online
|
||||
host=128.68.33.133
|
||||
host=37.146.179.134
|
||||
name=Help.DragAndDrop
|
||||
rev=2
|
||||
passwdedit=@lock
|
||||
rev=3
|
||||
targets=
|
||||
text=(:Title Drag and drop:)%0a(:Description How to drag and drop vertices in Graph Online:)%0a%0aIn order to drag a vertex you have to choose "Drag and drop" http://images.unick-soft.ru/photos/share/moveNode.png and select vertices and drag them. The edges will move after the vertices.%0a%0ahttp://images.unick-soft.ru/photos/share/Capture03_2.gif
|
||||
time=1471450741
|
||||
time=1495230265
|
||||
title=Drag and drop
|
||||
author:1471450741=
|
||||
diff:1471450741:1471353416:=4c4%0a%3c In order to drag a vertex you have to choose "Drag and drop" http://images.unick-soft.ru/photos/share/moveNode.png and select vertices and drag them. The edges will move after the vertices.%0a---%0a> In order to drag a vertex you have to choose "Drag" http://images.unick-soft.ru/photos/share/moveNode.png and select vertices and drag them. The edges will move after the vertices.%0a
|
||||
|
||||
Regular → Executable
+14
-7
@@ -1,15 +1,22 @@
|
||||
version=pmwiki-2.2.75 ordered=1 urlencoded=1
|
||||
agent=Mozilla/5.0 (Windows NT 6.1; WOW64; rv:41.0) Gecko/20100101 Firefox/41.0
|
||||
author=Zaiyah
|
||||
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=pKWCtX9tVo
|
||||
csum=
|
||||
ctime=1471539859
|
||||
host=188.143.232.32
|
||||
description=How to find connected component using Graph Online
|
||||
host=37.146.179.134
|
||||
name=Help.FindConnectedComponent
|
||||
rev=7
|
||||
passwdattr=@lock
|
||||
passwdedit=@lock
|
||||
rev=9
|
||||
targets=
|
||||
text=I found myself nodding my noggin all the way %3ca href="http://dymhdevwber.com">thuhgro.%3c/a>
|
||||
time=1485188765
|
||||
text=(:Title Find connected component :)%0a(:Description How to find connected component using Graph Online:)%0a%0a!! Connected component%0a%0aConnected component is highly connected subgraph of the graph. Thus, every graph may be divided to several connected components.%0a%0a!! Find connected components%0a%0aIn order to find connected components you have to choose Algorithms -> Find connected components in the menu bar. You will see the result immediately. Distinct connected components will be marked with distinct colours and will have a unique number. %0a%0ahttp://graphonline.ru/tmp/saved/XU/XUoFkErYflWXnqGO.png%0a%0a!! Algorithm%0a%0aGraph Online finds connected component for non-oriented graphs and it finds weakly connected component for oriented graphs. Breadth-first search is used for search. Implementation on JavaScript could be seen here: http://graphonline.ru/script/plugins/ConnectedComponent.js%0a
|
||||
time=1495230220
|
||||
title=Find connected component
|
||||
author:1495230173=
|
||||
diff:1495230173:1485188765:=1,16c1%0a%3c (:Title Find connected component :)%0a%3c (:Description How to find connected component using Graph Online:)%0a%3c %0a%3c !! Connected component%0a%3c %0a%3c Connected component is highly connected subgraph of the graph. Thus, every graph may be divided to several connected components.%0a%3c %0a%3c !! Find connected components%0a%3c %0a%3c In order to find connected components you have to choose Algorithms -> Find connected components in the menu bar. You will see the result immediately. Distinct connected components will be marked with distinct colours and will have a unique number. %0a%3c %0a%3c http://graphonline.ru/tmp/saved/XU/XUoFkErYflWXnqGO.png%0a%3c %0a%3c !! Algorithm%0a%3c %0a%3c Graph Online finds connected component for non-oriented graphs and it finds weakly connected component for oriented graphs. Breadth-first search is used for search. Implementation on JavaScript could be seen here: http://graphonline.ru/script/plugins/ConnectedComponent.js%0a---%0a> I found myself nodding my noggin all the way %3ca href="http://dymhdevwber.com">thuhgro.%3c/a>%0a\ No newline at end of file%0a
|
||||
host:1495230173=37.146.179.134
|
||||
author:1485188765=Zaiyah
|
||||
csum:1485188765=pKWCtX9tVo
|
||||
diff:1485188765:1485016511:=1c1%0a%3c I found myself nodding my noggin all the way %3ca href="http://dymhdevwber.com">thuhgro.%3c/a>%0a\ No newline at end of file%0a---%0a> Articles like these put the consumer in the driver seat-very %3ca href="http://tbdmnndsq.com">imttpoanr.%3c/a>%0a\ No newline at end of file%0a
|
||||
|
||||
Regular → Executable
Executable
+20
@@ -0,0 +1,20 @@
|
||||
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=
|
||||
charset=UTF-8
|
||||
csum=
|
||||
ctime=1521665253
|
||||
description=Как найти минимальное остовное дерево используя сервис graphonline.ru
|
||||
host=37.146.182.20
|
||||
name=Help.FindMinimumSpanningTree
|
||||
rev=2
|
||||
targets=
|
||||
text=(:Title Find Minimum Spanning Tree :)%0a(:Description Как найти минимальное остовное дерево используя сервис graphonline.ru :)%0a%0a!! Minimum Spanning Tree%0a%0aMinimum spanning tree (or minimum weight spanning tree) in a connected weighted undirected graph is a spanning tree of that graph which has a minimum possible weight. The weight of a tree means a sum of the edges’ weights. %0a%0aIn other words, minimum spanning tree is a subgraph which contains all the vertexes of the original graph, while the sum of the arcs’ weights is minimal.%0a%0a!! Algorithm usage examples%0a%0aWith the help of the searching algorithm of a minimum spanning tree, one can calculate %0aminimal road construction or network costs. %0a%0a!! Searching algorithm %0a%0aWe use [[https://en.wikipedia.org/wiki/Prim%2527s_algorithm | Prim’s algorithm]] for searching. %0a%0a!! How to use%0a%0a# Create a graph.%0a# Choose “Algorithms” in the menu bar then “Find minimum spanning tree”.%0a%0a%0ahttp://graphonline.ru/wiki/uploads/Справка/MinSpanningTree.gif%0a
|
||||
time=1521665268
|
||||
title=Find Minimum Spanning Tree
|
||||
author:1521665268=
|
||||
diff:1521665268:1521665253:=23d22%0a%3c %0a
|
||||
host:1521665268=37.146.182.20
|
||||
author:1521665253=
|
||||
diff:1521665253:1521665253:=1,24d0%0a%3c (:Title Find Minimum Spanning Tree :)%0a%3c (:Description Как найти минимальное остовное дерево используя сервис graphonline.ru :)%0a%3c %0a%3c !! Minimum Spanning Tree%0a%3c %0a%3c Minimum spanning tree (or minimum weight spanning tree) in a connected weighted undirected graph is a spanning tree of that graph which has a minimum possible weight. The weight of a tree means a sum of the edges’ weights. %0a%3c %0a%3c In other words, minimum spanning tree is a subgraph which contains all the vertexes of the original graph, while the sum of the arcs’ weights is minimal.%0a%3c %0a%3c !! Algorithm usage examples%0a%3c %0a%3c With the help of the searching algorithm of a minimum spanning tree, one can calculate %0a%3c minimal road construction or network costs. %0a%3c %0a%3c !! Searching algorithm %0a%3c %0a%3c We use [[https://en.wikipedia.org/wiki/Prim%2527s_algorithm | Prim’s algorithm]] for searching. %0a%3c %0a%3c !! How to use%0a%3c %0a%3c # Create a graph.%0a%3c # Choose “Algorithms” in the menu bar then “Find minimum spanning tree”.%0a%3c %0a%3c http://graphonline.ru/wiki/uploads/Справка/MinSpanningTree.gif%0a
|
||||
host:1521665253=37.146.182.20
|
||||
Regular → Executable
+8
-4
@@ -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
|
||||
|
||||
Regular → Executable
+24
-18
@@ -1,19 +1,37 @@
|
||||
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/54.0.2840.59 Safari/537.36 OPR/41.0.2353.46
|
||||
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=
|
||||
charset=UTF-8
|
||||
csum=
|
||||
ctime=1470345769
|
||||
description=Wiki help for Graph Online project.
|
||||
host=82.145.221.45
|
||||
host=37.146.182.20
|
||||
name=Help.Help
|
||||
passwdattr=@lock
|
||||
passwdedit=@lock
|
||||
rev=20
|
||||
targets=Help.AddVertex,Help.AddDirectedLine,Help.AdjacencyMatrix,Help.IncidenceMatrix,Help.DragAndDrop,Help.SaveGraph,Help.FindTheShortestPath,Help.FindConnectedComponent,Help.FindEulerianCycle,Development.Documentation
|
||||
text=(:Title Graph Online wiki help:)%0a(:Description Wiki help for Graph Online project.:)%0a%0a!!! Hot to create and edit graph%0a%0a# [[Help/Add vertex]].%0a# [[Help/Add directed line]].%0a# [[Help/Adjacency matrix]].%0a# [[Help/Incidence matrix]].%0a# [[Help/Drag and drop]].%0a# [[Help/Save graph]].%0a%0a!!! Algorithms%0a# [[Help/Find the shortest path]].%0a# [[Help/Find connected component]].%0a# [[Help/Find Eulerian Cycle]].%0a%0a!!! Development own algorithm%0a%0a# [[Development/Documentation]].%0a%0aNow we have wiki help. We will be grateful to those who will take part in adding articles to help menu. You are welcome to write one of the following articles:%0a
|
||||
time=1478123033
|
||||
rev=26
|
||||
targets=Help.AddVertex,Help.AddDirectedLine,Help.AdjacencyMatrix,Help.IncidenceMatrix,Help.DragAndDrop,Help.SaveGraph,Help.FindTheShortestPath,Help.FindConnectedComponent,Help.FindEulerianCycle,Help.FindMinimumSpanningTree,Help.BuildingGraphOfMinimalDistances,Help.OrganizeTheGraph,Help.VisualizationBasedOnWeights,Help.CalculateVertexesDegree,Help.SearchingForGraph’sRadiusAndDiameter,Development.Documentation
|
||||
text=(:Title Graph Online wiki help:)%0a(:Description Wiki help for Graph Online project.:)%0a%0a!!! Hot to create and edit graph%0a%0a# [[Help/Add vertex]].%0a# [[Help/Add directed line]].%0a# [[Help/Adjacency matrix]].%0a# [[Help/Incidence matrix]].%0a# [[Help/Drag and drop]].%0a# [[Help/Save graph]].%0a%0a!!! Algorithms%0a# [[Help/Find the shortest path]].%0a# [[Help/Find connected component]].%0a# [[Help/Find Eulerian Cycle]].%0a# [[Help/Find Minimum Spanning Tree]].%0a# [[Help/Building graph of minimal distances]].%0a# [[Help/Organize the graph]].%0a# [[Help/Visualization based on weights]].%0a# [[Help/Calculate vertexes degree]].%0a# [[Help/Searching for graph’s radius and diameter | +]].%0a%0a!!! Development own algorithm%0a%0a# [[Development/Documentation]].%0a%0aNow we have wiki help. We will be grateful to those who will take part in adding articles to help menu. You are welcome to write one of the following articles:%0a
|
||||
time=1522849940
|
||||
title=Graph Online wiki help
|
||||
author:1522849940=
|
||||
diff:1522849940:1522849575:=21,22c21%0a%3c # [[Help/Calculate vertexes degree]].%0a%3c # [[Help/Searching for graph’s radius and diameter | +]].%0a---%0a> # [[Help/Calculate vertexes degree | +]].%0a
|
||||
host:1522849940=37.146.182.20
|
||||
author:1522849575=
|
||||
diff:1522849575:1522849209:=20,21c20%0a%3c # [[Help/Visualization based on weights]].%0a%3c # [[Help/Calculate vertexes degree | +]].%0a---%0a> # [[Help/Visualization based on weights | +]].%0a
|
||||
host:1522849575=37.146.182.20
|
||||
author:1522849209=
|
||||
diff:1522849209:1522844873:=19,20c19%0a%3c # [[Help/Organize the graph]].%0a%3c # [[Help/Visualization based on weights | +]].%0a---%0a> # [[Help/Organize the graph | +]].%0a
|
||||
host:1522849209=37.146.182.20
|
||||
author:1522844873=
|
||||
diff:1522844873:1522844051:=18,19c18%0a%3c # [[Help/Building graph of minimal distances]].%0a%3c # [[Help/Organize the graph | +]].%0a---%0a> # [[Help/Building graph of minimal distances | +]].%0a
|
||||
host:1522844873=37.146.182.20
|
||||
author:1522844051=
|
||||
diff:1522844051:1521665061:=17,18c17%0a%3c # [[Help/Find Minimum Spanning Tree]].%0a%3c # [[Help/Building graph of minimal distances | +]].%0a---%0a> # [[Help/Find Minimum Spanning Tree | +]].%0a
|
||||
host:1522844051=37.146.182.20
|
||||
author:1521665061=
|
||||
diff:1521665061:1478123033:=17d16%0a%3c # [[Help/Find Minimum Spanning Tree | +]].%0a
|
||||
host:1521665061=37.146.182.20
|
||||
author:1478123033=
|
||||
diff:1478123033:1478122983:=22a23,24%0a> %0a> # [[Help/Find Eulerian trail]].%0a\ No newline at end of file%0a
|
||||
host:1478123033=82.145.221.45
|
||||
@@ -59,15 +77,3 @@ host:1470511699=128.68.33.133
|
||||
author:1470412471=
|
||||
diff:1470412471:1470410985:=10c10%0a%3c # [[Help/Drag and drop]].%0a---%0a> # [[Help/Перемещение вершин]].%0a
|
||||
host:1470412471=128.68.33.133
|
||||
author:1470410985=
|
||||
diff:1470410985:1470410955:=17c17%0a%3c # [[Help/Find Eulerian trail]].%0a\ No newline at end of file%0a---%0a> # [[Help/Find Eulerian trail].%0a\ No newline at end of file%0a
|
||||
host:1470410985=128.68.33.133
|
||||
author:1470410955=
|
||||
diff:1470410955:1470345986:=1,9c1,9%0a%3c (:Title:Graph Online wiki help:)%0a%3c (:Summary:Wiki help for Graph Online project.:)%0a%3c %0a%3c !!! Major parts of Graph Online Wiki%0a%3c %0a%3c # [[Help/Add vertex]].%0a%3c # [[Help/Add directed line]].%0a%3c # [[Help/Adjacency matrix]].%0a%3c # [[Help/Incidence matrix]].%0a---%0a> (:Title:Граф Онлайн вики справка:)%0a> (:Summary:Вики справка проекта Граф Онлайн.:)%0a> %0a> !!! Основные разделы Граф Онлайн Wiki%0a> %0a> # [[Help/Добавление вершины]].%0a> # [[Help/Добавление дуги]].%0a> # [[Help/Матрица смежности]].%0a> # [[Help/Матрица инцидентности]].%0a11,17c11,17%0a%3c # [[Help/Find the shortest path]].%0a%3c # [[Help/Save graph]].%0a%3c %0a%3c Now we have wiki help. We will be grateful to those who will take part in adding articles to help menu. You are welcome to write one of the following articles:%0a%3c %0a%3c # [[Help/Find connected component]].%0a%3c # [[Help/Find Eulerian trail].%0a\ No newline at end of file%0a---%0a> # [[Help/Поиск кратчайшего пути]].%0a> # [[Help/Сохранение графа]].%0a> %0a> Наш сервис обзавёлся вики справкой. Все кто хотят, могут помочь в написании справочных статей. Вы можете написать одну из следующих статей:%0a> %0a> # [[Help/Поиск компонентов связанности]].%0a> # [[Help/Поиск Эйлерового цикла]].%0a\ No newline at end of file%0a
|
||||
host:1470410955=128.68.33.133
|
||||
author:1470345986=
|
||||
diff:1470345986:1470345945:=6,13c6,13%0a%3c # [[Help/Добавление вершины]].%0a%3c # [[Help/Добавление дуги]].%0a%3c # [[Help/Матрица смежности]].%0a%3c # [[Help/Матрица инцидентности]].%0a%3c # [[Help/Перемещение вершин]].%0a%3c # [[Help/Поиск кратчайшего пути]].%0a%3c # [[Help/Сохранение графа]].%0a%3c %0a---%0a> # [[Справка/Добавление вершины]].%0a> # [[Справка/Добавление дуги]].%0a> # [[Справка/Матрица смежности]].%0a> # [[Справка/Матрица инцидентности]].%0a> # [[Справка/Перемещение вершин]].%0a> # [[Справка/Поиск кратчайшего пути]].%0a> # [[Справка/Сохранение графа]].%0a> %0a16,17c16,17%0a%3c # [[Help/Поиск компонентов связанности]].%0a%3c # [[Help/Поиск Эйлерового цикла]].%0a\ No newline at end of file%0a---%0a> # [[Справка/Поиск компонентов связанности]].%0a> # [[Справка/Поиск Эйлерового цикла]].%0a\ No newline at end of file%0a
|
||||
host:1470345986=128.68.33.133
|
||||
author:1470345945=
|
||||
diff:1470345945:1470345769:=1,17d0%0a%3c (:Title:Граф Онлайн вики справка:)%0a%3c (:Summary:Вики справка проекта Граф Онлайн.:)%0a%3c %0a%3c !!! Основные разделы Граф Онлайн Wiki%0a%3c %0a%3c # [[Справка/Добавление вершины]].%0a%3c # [[Справка/Добавление дуги]].%0a%3c # [[Справка/Матрица смежности]].%0a%3c # [[Справка/Матрица инцидентности]].%0a%3c # [[Справка/Перемещение вершин]].%0a%3c # [[Справка/Поиск кратчайшего пути]].%0a%3c # [[Справка/Сохранение графа]].%0a%3c %0a%3c Наш сервис обзавёлся вики справкой. Все кто хотят, могут помочь в написании справочных статей. Вы можете написать одну из следующих статей:%0a%3c %0a%3c # [[Справка/Поиск компонентов связанности]].%0a%3c # [[Справка/Поиск Эйлерового цикла]].%0a\ No newline at end of file%0a
|
||||
host:1470345945=128.68.33.133
|
||||
|
||||
Regular → Executable
+6
-5
@@ -1,17 +1,18 @@
|
||||
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/52.0.2743.82 Safari/537.36 OPR/39.0.2256.48
|
||||
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=
|
||||
ctime=1471298946
|
||||
description=About incidence matrix and the way it is used in Graph online
|
||||
host=128.68.33.133
|
||||
host=37.146.179.134
|
||||
name=Help.IncidenceMatrix
|
||||
rev=4
|
||||
passwdedit=@lock
|
||||
rev=5
|
||||
targets=
|
||||
text=(:Title Incidence Matrix :)%0a(:Description About incidence matrix and the way it is used in Graph online:)%0a%0a!! About incidence matrix%0aIncidence matrix represents a graph in the form of matrix, where every column defines a separate edge. Meanwhile, the matrix's rows define the vertices. A positive number defines a vertex, where an edge starts; whereas a negative number defines a vertex, where an edge finishes. If both numbers are positive, then the edge is non-oriented. %0a%0a!! Examples of the incidence matrices%0a%0a(:table width=100%25 :)%0a(:head:) Graph consisting of3 conjoined vertices%0a(:head:) Graph with oriented edges%0a(:head:) Graph with 4 vertices and one edge%0a(:cellnr align=center valign=center:) %0a[@ %0a 1, 0, -3%0a-1, 1, 0%0a 0, 1, 3%0a@]%0a(:cell align=center valign=center :) %0a[@%0a-1, 0, 0, 0%0a 0, 0, 0, -1%0a 0, -1, 0, 0%0a 0, 0, -1, 0%0a 1, 1, 1, 1%0a@]%0a(:cell align=center valign=center:) %0a[@%0a1%0a0%0a0%0a1%0a@]%0a(:cellnr align=center:) %25width=200px%25http://graphonline.ru/wiki/uploads/Справка/3_vertexes_graph_2.png%0a(:cell align=center:) %25width=200px%25http://graphonline.ru/wiki/uploads/Справка/orint_graph_2.png%0a(:cell align=center:) %25width=200px%25http://graphonline.ru/wiki/uploads/Справка/4_vertexes_graph2.png%0a(:cellnr align=center:) [[http://graphonline.ru/?graph=MJCWiAaqASDImcOd | Ссылка на граф]]%0a(:cell align=center:) [[http://graphonline.ru/?graph=lQQuGObVmYcQDwPf | Ссылка на граф]]%0a(:cell align=center:) [[http://graphonline.ru/?graph=RZdTrLUPeqNWLsGs | Ссылка на граф]]%0a(:tableend:)%0a%0a!! Incidence matrix in Graph Online %0a%0aGraph Online provides you with possibility to create [[http://graphonline.ru/create_graph_by_incidence_matrix| Создать граф по матрице инцидентности]].%0a%0a%25width=450px%25http://graphonline.ru/wiki/uploads/Справка/graph_from_incid_matrix.jpg%0a%0aMoreover, you can edit the existing incidence matrix. You have to choose Graph in the menu bar and then Incidence matrix.%0a%0a%25height=450px%25http://graphonline.ru/wiki/uploads/Справка/inicident_matrix.jpg%0a%0aIn order to use incidence matrix, you have to enter it in the right form.%0a%0a!!! The form for entering incidence matrix%0a%0a%25id=matrixFormat%25 Entering an incidence matrix you have to take into account the following principles:%0a%0a# The matrix should contain the number of rows equal to the number of vertices and the rows equal to the number of the edges. %0a# In order to define non-oriented edge, you have to put their weight into the rows corresponding to starting and finishing vertices. %0a# In order to define an oriented edge, you have to put its weight into the row corresponding to the starting vertex; and you have to put its weight with negative meaning into the rows corresponding to the finishing vertex. %0a(:head:) Right matrix %0a(:cellnr align=center valign=center bgcolor=#ffcccc:) %0a[@ %0a0,1,0%0a0,0,1%0a0,0,1%0a0,0,1%0a@]%0a(:cell align=center valign=center:) In the first column starting and finishing vertices are not enterd. In the row 3 the edge joining 3 vertices was entered, such a format is not supported.%0a(:cell align=center valign=center bgcolor=#ccffcc:)%0a[@ %0a1,0,0,0%0a0,1,0,1%0a0,1,1,0%0a0,0,1,1%0a@]%0a(:cellnr align=center valign=center bgcolor=#ffcccc:) %0a[@ %0a1, 0, 0%0a1, 1%0a0,-1%0a@]%0a(:cell align=center valign=center:) Last "0" in the first row is excess%0a(:cell align=center valign=center bgcolor=#ccffcc:)%0a[@ %0a1, 0%0a1, 1%0a0,-1%0a@]%0a%0a
|
||||
time=1471352689
|
||||
title=Incidence Matrix
|
||||
time=1495230340
|
||||
title=Incidence Matrix
|
||||
author:1471352689=
|
||||
diff:1471352689:1471351446:=10c10%0a%3c (:head:) Graph consisting of3 conjoined vertices%0a---%0a> (:head:) Graph consisting of 3 Граф из 3 conjoined vertices%0a59,61c59,69%0a%3c # In order to define non-oriented edge, you have to put their weight into the rows corresponding to starting and finishing vertices. %0a%3c # In order to define an oriented edge, you have to put its weight into the row corresponding to the starting vertex; and you have to put its weight with negative meaning into the rows corresponding to the finishing vertex. %0a%3c (:head:) Right matrix %0a---%0a> # Чтобы задать неориентированную дугу необходимо в строки, соответствующие начальной и конечной вершинам, поставить их вес.%0a> # Чтобы задать ориентированную дугу необходимо в строки, соответствующие начальной вершине, поставить её вес, а в соответствующие конечной вершине, её вес со знаком минус.%0a> %0a> А теперь рассмотрим основные ошибки ввода матриц инцидентности.%0a> %0a> !! Основные ошибки ввода матриц инцидентности%0a> %0a> (:table width=100%25 cellspacing=4 :)%0a> (:head:) Неправильная матрица%0a> (:head:) Причина ошибки%0a> (:head:) Правильная матрица%0a69c77%0a%3c (:cell align=center valign=center:) In the first column starting and finishing vertices are not enterd. In the row 3 the edge joining 3 vertices was entered, such a format is not supported.%0a---%0a> (:cell align=center valign=center:) В первом столбце не задана начальная и конечная вершины. В 3 столбце задана дуга, соединяющая 3 вершины, такой формат не поддерживается.%0a83c91%0a%3c (:cell align=center valign=center:) Last "0" in the first row is excess%0a---%0a> (:cell align=center valign=center:) Последний ноль в первой строке лишний%0a
|
||||
host:1471352689=128.68.33.133
|
||||
|
||||
Executable
+20
@@ -0,0 +1,20 @@
|
||||
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=
|
||||
charset=UTF-8
|
||||
csum=
|
||||
ctime=1522845041
|
||||
description=Organize the graph and place it on the two-dimentional serface
|
||||
host=37.146.182.20
|
||||
name=Help.OrganizeTheGraph
|
||||
rev=2
|
||||
targets=
|
||||
text=(:Title Organize the graph:)%0a(:Description Organize the graph and place it on the two-dimentional serface:)%0a%0a%0a!!! Algorithm%0a%0aOrganizing is such graph placement on the two-dimentional subspace when minimization of crossing of arches and vertexes occurs.%0a%0aPlease note that sometimes the algorithm doesn’t work perfectly.%0a%0aIn order to use the algorithm choose “Algorithms” in the menu bar and then “Organize the graph”.%0a%0ahttp://graphonline.ru/wiki/uploads/Справка/reorder_graph.gif
|
||||
time=1522845135
|
||||
title=Organize the graph
|
||||
author:1522845135=
|
||||
diff:1522845135:1522845041:=1c1%0a%3c (:Title Organize the graph:)%0a---%0a> (:Title Упорядочить граф:)%0a
|
||||
host:1522845135=37.146.182.20
|
||||
author:1522845041=
|
||||
diff:1522845041:1522845041:=1,13d0%0a%3c (:Title Упорядочить граф:)%0a%3c (:Description Organize the graph and place it on the two-dimentional serface:)%0a%3c %0a%3c %0a%3c !!! Algorithm%0a%3c %0a%3c Organizing is such graph placement on the two-dimentional subspace when minimization of crossing of arches and vertexes occurs.%0a%3c %0a%3c Please note that sometimes the algorithm doesn’t work perfectly.%0a%3c %0a%3c In order to use the algorithm choose “Algorithms” in the menu bar and then “Organize the graph”.%0a%3c %0a%3c http://graphonline.ru/wiki/uploads/Справка/reorder_graph.gif%0a\ No newline at end of file%0a
|
||||
host:1522845041=37.146.182.20
|
||||
Regular → Executable
+5
-5
@@ -1,11 +1,11 @@
|
||||
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_12_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/64.0.3282.186 Safari/537.36 OPR/51.0.2830.62
|
||||
charset=UTF-8
|
||||
ctime=1470345845
|
||||
host=37.146.179.134
|
||||
host=37.146.182.20
|
||||
name=Help.RecentChanges
|
||||
passwdattr=@lock
|
||||
passwdedit=@lock
|
||||
rev=52
|
||||
text=* [[Help/FindTheShortestPath]] . . . January 28, 2017, at 10:16 PM by ?: [==]%0a* [[Help/FindConnectedComponent]] . . . January 23, 2017, at 07:26 PM by [[~Zaiyah]]: [=pKWCtX9tVo=]%0a* [[Help/FindEulerianCycle]] . . . November 05, 2016, at 02:31 PM by ?: [==]%0a* [[Help/Help]] . . . November 03, 2016, at 12:43 AM by ?: [==]%0a* [[Help/SaveGraph]] . . . August 19, 2016, at 11:12 PM by ?: [==]%0a* [[Help/DragAndDrop]] . . . August 17, 2016, at 07:19 PM by ?: [==]%0a* [[Help/IncidenceMatrix]] . . . August 16, 2016, at 04:04 PM by ?: [==]%0a* [[Help/AdjacencyMatrix]] . . . August 13, 2016, at 07:08 PM by ?: [==]%0a* [[Help/AddDirectedLine]] . . . August 12, 2016, at 10:06 PM by ?: [==]%0a* [[Help/AddVertex]] . . . August 11, 2016, at 09:49 PM by ?: [==]%0a
|
||||
time=1485630964
|
||||
rev=68
|
||||
text=* [[Help/SearchingForGraph’sRadiusAndDiameter]] . . . April 04, 2018, at 04:57 PM by ?: [==]%0a* [[Help/Help]] . . . April 04, 2018, at 04:52 PM by ?: [==]%0a* [[Help/CalculateVertexesDegree]] . . . April 04, 2018, at 04:50 PM by ?: [==]%0a* [[Help/VisualizationBasedOnWeights]] . . . April 04, 2018, at 04:43 PM by ?: [==]%0a* [[Help/OrganizeTheGraph]] . . . April 04, 2018, at 03:32 PM by ?: [==]%0a* [[Help/BuildingGraphOfMinimalDistances]] . . . April 04, 2018, at 03:18 PM by ?: [==]%0a* [[Help/FindMinimumSpanningTree]] . . . March 21, 2018, at 11:47 PM by ?: [==]%0a* [[Help/FindConnectedComponent]] . . . May 20, 2017, at 12:42 AM by ?: [==]%0a* [[Help/FindTheShortestPath]] . . . May 20, 2017, at 12:41 AM by ?: [==]%0a* [[Help/FindEulerianCycle]] . . . November 05, 2016, at 02:31 PM by ?: [==]%0a* [[Help/SaveGraph]] . . . August 19, 2016, at 11:12 PM by ?: [==]%0a* [[Help/DragAndDrop]] . . . August 17, 2016, at 07:19 PM by ?: [==]%0a* [[Help/IncidenceMatrix]] . . . August 16, 2016, at 04:04 PM by ?: [==]%0a* [[Help/AdjacencyMatrix]] . . . August 13, 2016, at 07:08 PM by ?: [==]%0a* [[Help/AddDirectedLine]] . . . August 12, 2016, at 10:06 PM by ?: [==]%0a* [[Help/AddVertex]] . . . August 11, 2016, at 09:49 PM by ?: [==]%0a
|
||||
time=1522850263
|
||||
|
||||
Regular → Executable
+7
-6
@@ -1,17 +1,18 @@
|
||||
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/52.0.2743.82 Safari/537.36 OPR/39.0.2256.48
|
||||
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=
|
||||
ctime=1471354262
|
||||
description=How to save graph in Graph Online
|
||||
host=128.68.33.133
|
||||
description=How to save graph in Graph Online
|
||||
host=37.146.179.134
|
||||
name=Help.SaveGraph
|
||||
rev=4
|
||||
passwdedit=@lock
|
||||
rev=5
|
||||
targets=
|
||||
text=(:Title Save graph :)%0a(:Description How to save graph in Graph Online :)%0a%0a!! Save graph %0a%0aChoosing Graph in the menu bar and then Save, you will save a graph on the server. At the same time you will see this popup window:%0a%0ahttp://images.unick-soft.ru/photos/share/2016_01_22_15_31_40.png%0a%0aThe link could be sent to your email or you may post it on the social media. Here is the example: [[http://graphonline.ru/en/?graph=FXsDdtxEEWZVWLoZ]]%0a%0a%0a!! How to save the image of the graph %0a%0aIf you choose Graph -> Save image in the menu bar, you will save the image of the graph on the server. In the popup window:%0a%0ahttp://images.unick-soft.ru/photos/share/2016_01_22_15_32_34.png%0a%0aYou may save the image into a file or post it on the social media. Here is an example:%0a%0ahttp://graphonline.ru/tmp/saved/qr/qrtLnAMVnkRHwkKF.png
|
||||
time=1471637564
|
||||
title=Save graph
|
||||
time=1495230355
|
||||
title=Save graph
|
||||
author:1471637564=
|
||||
diff:1471637564:1471358850:=10c10%0a%3c The link could be sent to your email or you may post it on the social media. Here is the example: [[http://graphonline.ru/en/?graph=FXsDdtxEEWZVWLoZ]]%0a---%0a> The link could be sent to your email or you may post it on the social media. Here is the example: [[http://graphonline.ru/?graph=FXsDdtxEEWZVWLoZ]]%0a
|
||||
host:1471637564=128.68.33.133
|
||||
|
||||
@@ -0,0 +1,17 @@
|
||||
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=
|
||||
charset=UTF-8
|
||||
csum=
|
||||
ctime=1522850263
|
||||
description=Searching for graph’s radius and diameter and central and peripheral vertexes
|
||||
host=37.146.182.20
|
||||
name=Help.SearchingForGraph’sRadiusAndDiameter
|
||||
rev=1
|
||||
targets=
|
||||
text=(:Title Searching for graph’s radius and diameter:)%0a(:Description Searching for graph’s radius and diameter and central and peripheral vertexes:)%0a%0a!! Specifications%0a%0a'''The eccentricity of a graph vertex''' is the maximum distance till the distant vertex.%0a%0a'''The radius of a graph''' is the minimum eccentricity among all the vertexes of a graph.%0a%0a'''The diameter of a graph''' is the longest distance among all the pairs of the graph’s vertexes.%0a%0a'''The central vertex of a graph''' is the vertex which eccentricity equals the graph’s radius.%0a%0a'''The peripheral vertex of a graph''' is the vertex which eccentricity equals the graph’s diameter. %0a%0a!! Searching for radius and diameter%0a%0aGraph Online allows users to find radius and diameter. Moreover, it will point out the central and peripheral vertexes. In order to do it choose “Algorithms” and then “Search graph radius and diameter”.%0a%0ahttp://graphonline.ru/wiki/uploads/Справка/radiusAndDiameter.gif%0a%0aImplementation of the algorithm for JavaScript could be found at http://graphonline.ru/script/plugins/RadiusAndDiameter.js%0a%0a
|
||||
time=1522850263
|
||||
title=Searching for graph’s radius and diameter
|
||||
author:1522850263=
|
||||
diff:1522850263:1522850263:=1,23d0%0a%3c (:Title Searching for graph’s radius and diameter:)%0a%3c (:Description Searching for graph’s radius and diameter and central and peripheral vertexes:)%0a%3c %0a%3c !! Specifications%0a%3c %0a%3c '''The eccentricity of a graph vertex''' is the maximum distance till the distant vertex.%0a%3c %0a%3c '''The radius of a graph''' is the minimum eccentricity among all the vertexes of a graph.%0a%3c %0a%3c '''The diameter of a graph''' is the longest distance among all the pairs of the graph’s vertexes.%0a%3c %0a%3c '''The central vertex of a graph''' is the vertex which eccentricity equals the graph’s radius.%0a%3c %0a%3c '''The peripheral vertex of a graph''' is the vertex which eccentricity equals the graph’s diameter. %0a%3c %0a%3c !! Searching for radius and diameter%0a%3c %0a%3c Graph Online allows users to find radius and diameter. Moreover, it will point out the central and peripheral vertexes. In order to do it choose “Algorithms” and then “Search graph radius and diameter”.%0a%3c %0a%3c http://graphonline.ru/wiki/uploads/Справка/radiusAndDiameter.gif%0a%3c %0a%3c Implementation of the algorithm for JavaScript could be found at http://graphonline.ru/script/plugins/RadiusAndDiameter.js%0a%3c %0a
|
||||
host:1522850263=37.146.182.20
|
||||
+17
@@ -0,0 +1,17 @@
|
||||
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=
|
||||
charset=UTF-8
|
||||
csum=
|
||||
ctime=1522849414
|
||||
description=Visualization based on weights Definie the size of the vertexes depending on the exponent and the arches’ thickness depending on the weight
|
||||
host=37.146.182.20
|
||||
name=Help.VisualizationBasedOnWeights
|
||||
rev=1
|
||||
targets=
|
||||
text=(:Title Visualization based on weights:)%0a(:Description Visualization based on weights Definie the size of the vertexes depending on the exponent and the arches’ thickness depending on the weight:)%0a%0a%0a!!! Visualization based on weights%0a%0aGraph visualization can be more informative if more valued vertexes and arches are bigger and thicker. Visualization on the basis of weights defines the size of the vertexes depending on the exponent and the arches’ thickness depending on the weight.%0a%0aIn order to use the algorithm choose “Algorithms” in the menu bar and then “Visualization based on the weight”.%0a%0ahttp://graphonline.ru/wiki/uploads/Справка/graph_moden_vis.gif%0a%0ahttp://graphonline.ru/wiki/uploads/Справка/graph_moder_vis.png
|
||||
time=1522849414
|
||||
title=Visualization based on weights
|
||||
author:1522849414=
|
||||
diff:1522849414:1522849414:=1,13d0%0a%3c (:Title Visualization based on weights:)%0a%3c (:Description Visualization based on weights Definie the size of the vertexes depending on the exponent and the arches’ thickness depending on the weight:)%0a%3c %0a%3c %0a%3c !!! Visualization based on weights%0a%3c %0a%3c Graph visualization can be more informative if more valued vertexes and arches are bigger and thicker. Visualization on the basis of weights defines the size of the vertexes depending on the exponent and the arches’ thickness depending on the weight.%0a%3c %0a%3c In order to use the algorithm choose “Algorithms” in the menu bar and then “Visualization based on the weight”.%0a%3c %0a%3c http://graphonline.ru/wiki/uploads/Справка/graph_moden_vis.gif%0a%3c %0a%3c http://graphonline.ru/wiki/uploads/Справка/graph_moder_vis.png%0a\ No newline at end of file%0a
|
||||
host:1522849414=37.146.182.20
|
||||
Regular → Executable
Regular → Executable
Regular → Executable
Regular → Executable
Executable
+9
@@ -0,0 +1,9 @@
|
||||
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/59.0.3071.115 Safari/537.36 OPR/46.0.2597.57
|
||||
charset=UTF-8
|
||||
ctime=1501541686
|
||||
host=37.146.179.134
|
||||
name=Profile.GroupAttributes
|
||||
passwdedit=$2y$10$nnlQnAtOstE.zNxN6gBw2.9TP9iEg.oamWABMDYCrAx.S.vQiRPFC
|
||||
rev=1
|
||||
time=1501541686
|
||||
Regular → Executable
+5
-5
File diff suppressed because one or more lines are too long
Regular → Executable
Regular → Executable
Regular → Executable
Regular → Executable
File diff suppressed because one or more lines are too long
Regular → Executable
Reference in New Issue
Block a user