Summary

• Page properties (2 modified, 0 added, 0 removed)

Details

Page properties

Author

...	...	@@ -1,1 +1,1 @@
1		-XWiki.uru
	1	+XWiki.stu230980

Content

...	...	@@ -1,8 +1,7 @@
1		-{{panel title="Project Overview"}}
	1	+== Project Overview ==
2	2	Related Theses:
3	3
4	4	* Martin Rieß, //A Graph Editor for Algorithm Engineering//, September 2010 ([[pdf>>url:http://rtsys.informatik.uni-kiel.de/%7Ebiblio/downloads/theses/mri-bt.pdf||shape="rect"]])
5		-{{/panel}}
6	6
7	7	The Graph Analysis (GrAna) project allows to examine a broad variety of structural properties of a graph (node count, edge count, etc.) as well as properties of the final drawing (area, edge crossings, etc.). An analysis can either be performed on a single graph or batch-like on large collections of graphs, in which case the results are written to a file. We support a variety of input formats, namely every format our formats service knows about.
8	8
...	...	@@ -10,13 +10,13 @@
10	10
11	11	{{toc/}}
12	12
13		-{{note}}
	12	+{{info}}
14	14	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.
15		-{{/note}}
	14	+{{/info}}
16	16
17	17	= Single Graphs Within the Editor =
18	18
19		-Within Eclipse we provide a //Graph Analysis// view, which can be found via Eclipse's //Windows->Show View->Others// dialog.
	18	+Within Eclipse we provide a //Graph Analysis// view, which can be found via Eclipse's //Windows->Show View->Others// dialog.
20	20	In the top right corner of this view you can find two buttons, one of which performs the analysis on the lastly selected diagram. The other button allows you to configure the analysis, i.e. select specific analyses to perform. The following screenshot shows an example. On the very left it can be seen that the analysis was configured to list the node and edge count, the area, and the number of edge crossings. According to the results, the graph contains 4 nodes and 5 edges. This is correct because the //hyperedge// between nodes N2, N3, and N4 is structurally composed out of two edges and just drawn as a single edge. Counting hyperedges could be a different analysis. Moreover, the area is reported as 25800 and 0 edge crossings are present.
21	21
22	22
...	...	@@ -45,8 +45,8 @@
45	45	globalOutputs
46	46	original_alg "/Test/results/original.csv"
47	47	awesome_alg "file://workspaces/eclps/Test/results/new.csv"
48		- thoroughness "/Test/results/thorough.csv"
49		- compare "/Test/results/compare.csv"
	47	+ thoroughness "/Test/results/thorough.csv"
	48	+ compare "/Test/results/compare.csv"
50	50
51	51	execute all
52	52
...	...	@@ -122,7 +122,7 @@
122	122	Second, you can use an Eclipse //Wizard// to select one or more sets of graphs, specify and configure a layout algorithm, and select a set of analyses. Results are then written to a //.csv// file (or more precisely semicolon-separated-file).
123	123	The following series of screenshots illustrates the process of using the wizard.
124	124	[[image:attach:granaWizard.jpg]]
125		-\\
	124	+
126	126
127	127	= Required Plugins =
128	128
...	...	@@ -129,7 +129,7 @@
129	129	* (((
130	130	Core:
131	131
132		-*
	131	+*
133	133
134	134	{{code language="none"}}
135	135	de.cau.cs.kieler.grana