<
From version < 15.1 >
edited by cds
on 2013/04/11 17:34
To version < 13.1 >
edited by cds
on 2013/04/11 15:46
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -1,10 +1,16 @@
1 +{{warning title="Work in Progress"}}
2 +This tutorial is still being worked on. Don't start working on it just yet.
3 +{{/warning}}
4 +
1 1  Welcome to the second tutorial! We will work our way through installing a proper Eclipse setup and developing a first very basic layout algorithm. The layout algorithm will integrate with KIML (KIELER Infrastructure for Meta-Layout), our very own framework that connects graphical editors with layout algorithms. Once you're finished, you should be able to create new Eclipse plug-ins and know how to write layout algorithms for KIML. And you should have a running Eclipse-based application that should look something like this:
2 2  
3 -[[image:attach:le_app_formidable.png]]
4 -
5 5  
6 6  
7 7  {{warning title="ToDo"}}
10 +Insert screen shot of final application.
11 +{{/warning}}
12 +
13 +{{warning title="ToDo"}}
8 8  Insert link to presentation slides.
9 9  {{/warning}}
10 10  
... ... @@ -189,7 +189,9 @@
189 189  progressMonitor.done();
190 190  {{/code}}
191 191  )))
192 -1. It is now time to write the code that places the nodes.Your code should place them next to each other in a row, as seen in the screenshot at the beginning of the tutorial.
198 +1. It is now time to write the code that places the nodes. Here's two suggestions for how you can place them:\\
199 +1*. The simplest way is to place nodes in a row, next to each other. To make this more interesting, you could also place the nodes along the graph of a Sine function.
200 +1*. Another way might be to place them in a square or a circle. You would have to think about how exactly to align the nodes, which may well vary in size.
193 193  
194 194  {{info title="Tips"}}
195 195  The following tips might come in handy...
... ... @@ -258,11 +258,9 @@
258 258   * Routes the edges connecting the nodes in the given graph.
259 259   *
260 260   * @param parentNode the graph whose edges to route.
261 - * @param yStart y coordinate of the start of the edge routing area.
262 - * @param objectSpacing the object spacing.
263 263   * @return height used for edge routing.
264 264   */
265 -private float routeEdges(final KNode parentNode, final float yStart, final float objectSpacing) {
271 +private float routeEdges(final KNode parentNode) {
266 266   // TODO: Implement edge routing
267 267  
268 268   return 0;
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -6160483
1 +6160479
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SS13LayPract/pages/6160483/KIML
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SS13LayPract/pages/6160479/KIML