Changes for page Graph Analysis (GrAna)
Last modified by Richard Kreissig on 2023/09/14 10:38
Summary
-
Page properties (1 modified, 0 added, 0 removed)
-
Objects (1 modified, 0 added, 0 removed)
Details
- Page properties
-
- Content
-
... ... @@ -1,7 +1,7 @@ 1 1 {{panel title="Project Overview"}} 2 2 Responsible: 3 3 4 -* {{mention reference="XWiki.uru" style="FULL_NAME" anchor="XWiki-uru-E Ixca"/}}4 +* {{mention reference="XWiki.uru" style="FULL_NAME" anchor="XWiki-uru-PMoJE"/}} 5 5 6 6 Related Theses: 7 7 ... ... @@ -14,6 +14,10 @@ 14 14 15 15 {{toc/}} 16 16 17 +{{note}} 18 +A word of warning. Please scrutinize any results you get from GrAna. A lot of the existing analyses were written with certain graphs structures and use cases in mind. For instance, if the analysis does not account for self loops but your graph contains them, the results might be wrong. 19 +{{/note}} 20 + 17 17 = Single Graphs Within the Editor = 18 18 19 19 Within Eclipse we provide a //Graph Analysis// view, which can be found via Eclipse's //Windows->Show View->Others// dialog. ... ... @@ -30,6 +30,8 @@ 30 30 31 31 You can specify a list of {{code language="none"}}Job{{/code}}s. A job is a self-contained unit of work. It specifies the previously mentioned data using the following keywords: {{code language="none"}}resources{{/code}}, {{code language="none"}}layoutoptions{{/code}}, {{code language="none"}}analyses{{/code}}, and {{code language="none"}}output{{/code}}. Layout options are specified by blocks that start with an arbitrary identifier followed by curly brackets. It is possible to specify multiple blocks of layout options. Each block results in a separate layout run allowing, for instance, to first execute a node placement algorithm and then an edge routing algorithm. For convenience it is possible to specify resources and output files globally at the beginning of the file and then use the {{code language="none"}}ref{{/code}} keyword to reference them from a job. 32 32 37 +Besides jobs, there is also a {{code language="none"}}RangeJob{{/code}} which can be used analyze the effect of a specific layout option onto a specific metric. In the example below, the //thoroughness// layout option is registered using the {{code language="none"}}rangeoption{{/code}} keyword. An integer range is specified resulting in all values between (inclusive) 1 and 50 being tested. While the analyses specified using the {{code language="none"}}analyses{{/code}} keyword are only measured on the initial graph, the analysis specified using the {{code language="none"}}rangeanalysis{{/code}} keyword will be measured for every tested value of the range layout option. Since analyses can be composed out of multiple components (e.g. the edge crossing analysis states the minimum, maximum, and average number of crossings per edge as well as the sum – four components), the {{code language="none"}}component{{/code}} keyword tells GrAna which component to write to the output file. 38 + 33 33 To execute GrAna based on a //.grana// file, right click the file and select //Execute Analysis Batch ...// 34 34 35 35 {{code language="java"}} ... ... @@ -41,6 +41,7 @@ 41 41 globalOutputs 42 42 original_alg "/Test/results/original.csv" 43 43 awesome_alg "file://workspaces/eclps/Test/results/new.csv" 50 + thoroughness "/Test/results/thorough.csv" 44 44 45 45 execute all 46 46 ... ... @@ -76,6 +76,25 @@ 76 76 de.cau.cs.kieler.kiml.grana.nodeCount 77 77 de.cau.cs.kieler.kiml.grana.edgeCrossings 78 78 output ref awesome_alg 86 + 87 +rangejob thoroughness 88 + resources 89 + ref random 90 + layoutoptions 91 + klay { 92 + de.cau.cs.kieler.algorithm: de.cau.cs.kieler.klay.layered 93 + de.cau.cs.kieler.klay.layered.crossMin: LAYER_SWEEP 94 + } 95 + analyses 96 + de.cau.cs.kieler.kiml.grana.nodeCount 97 + rangeoption 98 + de.cau.cs.kieler.klay.layered.thoroughness 99 + intrange 1 to 50 100 + // floatvalues 0.3, 0.4, 0.5 101 + rangeanalysis 102 + de.cau.cs.kieler.kiml.grana.edgeCrossings 103 + component 3 104 + output ref thoroughness 79 79 {{/code}} 80 80 81 81 == Eclipse Wizard == ... ... @@ -85,10 +85,6 @@ 85 85 [[image:attach:granaWizard.jpg]] 86 86 \\ 87 87 88 -{{note}} 89 -A word of warning. Please scrutinize any results you get from GrAna. A lot of the existing analyses were written with certain graphs structures and use cases in mind. For instance, if the analysis does not account for self loops but your graph contains them, the results might be wrong. 90 -{{/note}} 91 - 92 92 = Required Plugins = 93 93 94 94 * (((
- Confluence.Code.ConfluencePageClass[0]
-
- Id
-
... ... @@ -1,1 +1,1 @@ 1 - 122882751 +28672399 - URL
-
... ... @@ -1,1 +1,1 @@ 1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/ 12288275/Graph Analysis (GrAna)1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/28672399/Graph Analysis (GrAna)