Summary

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

Details

Page properties

Author

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

Content

...	...	@@ -2,10 +2,10 @@
2	2
3	3	= Preliminaries =
4	4
5		-[[doc:KIELER.Tutorials.Other.Installing Eclipse for Layout Development.WebHome]]
	5	+[[doc:KIELER.Development.Tutorials.Other.Installing Eclipse for Layout Development.WebHome]]
6	6
7		-{{excerpt-include/}}
8	8
	8	+
9	9	== Getting the Source Code ==
10	10
11	11	Additionally, we need to get our hands on the actual source code of KLay Layered. You can find it in the //pragmatics// repository in our Stash.
...	...	@@ -30,7 +30,7 @@
30	30
31	31	Don't hesitate to switch between the tasks and don't be afraid of exceptions or errors during debugging. When you use your layering phase without the intermediate processors the rest of KLay Layered will most likely complain (for cyclic input graphs). In other words, the following two assignments only work combined and not alone.
32	32
33		-{{panel title="Assignment (a)"}}
	33	+Assignment (a)
34	34	Create a layout phase called
35	35
36	36	{{code language="none"}}
...	...	@@ -43,7 +43,7 @@
43	43	ILayoutPhase
44	44	{{/code}}
45	45
46		- interface and has to be added to the
	46	+ interface and has to be added to the
47	47
48	48	{{code language="none"}}
49	49	CycleBreakingStrategy
...	...	@@ -50,9 +50,11 @@
50	50	{{/code}}
51	51
52	52	enumeration.
53		-{{/panel}}
54	54
55		-{{panel title="Assignment (b)"}}
	54	+
	55	+
	56	+Assignment (b)
	57	+
56	56	Write an intermediate processor that takes a //layered// graph (i.e. the result of assigment 2) as input and reverses edges such that the output graph is acyclic. Here are some hints.
57	57
58	58	The {{code language="none"}}LEdge{{/code}} offers a method {{code language="none"}}reverseEdge{{/code}} that does parts of the job for you and marks the edge such that the {{code language="none"}}ReversedEdgeRestorer {{/code}}will take care of 'back'-reversing the edge at the end of the algorithm. Your class should extend the {{code language="none"}}ILayoutProcessor{{/code}} interface.
...	...	@@ -68,9 +68,9 @@
68	68	}
69	69	}
70	70	{{/code}}
71		-{{/panel}}
72	72
73		-{{panel title="Assignment (c)"}}
	74	+Assignment (c)
	75	+
74	74	Write a layer assignment algorithm that assigns nodes of a possibly cyclic input graph to layers. The only requirement is that you don't assign layers randomly.
75	75
76	76	The intermediate processing configuration has to include your previously created intermediate processor as well as the existing {{code language="none"}}ReversedEdgeRestorer{{/code}}. The {{code language="none"}}IntermediateProcessorStrategy{{/code}} can help you to find the phase after which to execute the {{code language="none"}}ReversedEdgeRestorer{{/code}}.
...	...	@@ -92,18 +92,16 @@
92	92	}
93	93	}
94	94	{{/code}}
95		-{{/panel}}
96	96
97		-{{tip}}
	98	+{{info}}
98	98	Use {{code language="none"}}node.setLayer(layerX);{{/code}} to add assign a layer to a node. Internally, the node will be added to the layer's list of nodes.
99	99
100	100	Don't forget to let the switch statements in the {{code language="none"}}LayeringStrategy{{/code}} and {{code language="none"}}IntermediateProcessorStrategy{{/code}} enumerations know about the new classes.
101	101
102	102	The layout options you definitely need are {{code language="none"}}de.cau.cs.kieler.klay.layered.cycleBreaking{{/code}} and {{code language="none"}}de.cau.cs.kieler.klay.layered.nodePlace{{/code}}.
103		-{{/tip}}
	104	+{{/info}}
104	104
105	105	A result might look like this. The default strategies of KLay Layered try to achieve short edges and a low number of reversed edges. The left screenshot shows the result of a random layerer and is obviously inferior to the result seen in the right screenshot.
106	106
107		-
108	108
109	109	[[image:attach:rand.jpg]][[image:attach:klay.jpg]]