Child pages
  • KIML

Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.
Comment: Migrated to Confluence 5.3
Warning
titleWork in Progress

This tutorial is still being worked on. Don't start working on it just yet.

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:

 

Warning
titleToDo

Insert screen shot of final application.

Warning
titleToDo

Insert link to presentation slides.

Image Added

Table of Contents

Preliminaries

...

As far as KIML and layout algorithms are concerned, you can always refer to our Wiki which has a section about KIML and the KIELER layout projects. The documentation is not complete, however, so feel free to ask Miro or Christoph Daniel for help if you have questions that the documentation fails to answer.

...

  1. Add the following constants:

    Code Block
    languagejava
    /** default value for spacing between nodes. */
    private static final float DEFAULT_SPACING = 15.0f;
  2. Use the following code as the skeleton of the doLayout(...) method:

    Code Block
    languagejava
    progressMonitor.begin("Login_name layouter", 1);
    KShapeLayout parentLayout = layoutNodeparentNode.getData(KShapeLayout.class);
    
    float objectSpacing = parentLayout.getPRopertygetProperty(LayoutOptions.SPACING);
    if (objectSpacing < 0) {
        objectSpacing = DEFAULT_SPACING;
    }
    
    float borderSpacing = parentLayout.getProperty(LayoutOptions.BORDER_SPACING);
    if (borderSpacing < 0) {
        borderSpacing = DEFAULT_SPACING;
    }
    
    // TODO: Insert actual layout code.
    
    progressMonitor.done();
  3. Put the following code at the end of the doLayout(...) method:

    Code Block
    languagejava
    progressMonitor.done();

 

This exercise will introduce the usage of the Eclipse Plugin Development Environment for developing new layout algorithms to be used in Eclipse diagram editors. Replace each <login> by your own login name (e.g. msp), and each <Login> by your login name with capitalized first letter (e.g. Msp). For any questions contact msp.

  1. Implement the layout provider class
    1. Add the following constant to the class:
    2.     /** default value for spacing between nodes. */
          private static final float DEFAULT_SPACING = 15.0f;
      
    3. Write the following lines at the beginning of the doLayout method:
              progressMonitor.begin("<Login> Layouter", 1);
              KShapeLayout parentLayout = layoutNode.getData(KShapeLayout.class);
              float objectSpacing = parentLayout.getProperty(LayoutOptions.SPACING);
              if (objectSpacing < 0) {
                  objectSpacing = DEFAULT_SPACING;
              }
              float borderSpacing = parentLayout.getProperty(LayoutOptions.BORDER_SPACING);
              if (borderSpacing < 0) {
                  borderSpacing = DEFAULT_SPACING;
              }
      
    4. Write the following line at the end of the doLayout method:
              progressMonitor.done();
      
    5. Implement the rest of the layouter such that the nodes of the input graph are all put in a row.
      • See the KGraph and KLayoutData data structures: the input is a KNode and holds the nodes of the graph in its list of children
      • Iterate over the nodes in the getChildren() list of the layoutNode input
      • Retrieve the size of a node using the following code:
                KShapeLayout nodeLayout = node.getData(KShapeLayout.class);
                float width = nodeLayout.getWidth();
                float height = nodeLayout.getHeight();
        
      • Set the position (x, y) of a node's upper left corner using the following code:
                nodeLayout.setXpos(x);
                nodeLayout.setYpos(y);
        
      • objectSpacing shall be the spacing to be left between each pair of nodes.
      • borderSpacing shall be the spacing to be left to the borders of the drawing: the first node's coordinates shall be (borderSpacing, borderSpacing).
      • At the end of the method, set the width and height of parentLayout so that it is large enough to hold the whole drawing, including borders.
      • Edges may be ignored for now.
  2. Open the file META-INF/MANIFEST.MF  Extensions tab
    1. Add an extension for de.cau.cs.kieler.kiml.layout.layoutProviders
    2. Right-click the extension  New  layoutProvider
    3. Set name to <Login> Test Layouterclass to de.cau.cs.rtprak.<login>.tutorial2.<Login>LayoutProvider
    4. Right-click the new layoutProvider  New  knownOption, set option to de.cau.cs.kieler.spacing
    5. Add another knownOption, set to de.cau.cs.kieler.borderSpacing
  3. Run  Run Configurations...  right-click Eclipse Application  New
    1. Name: Layout
    2. For testing the layouter, a new workspace location will be created; you may configure its destination in Workspace Data  Location
    3. Add the program arguments -debug -consoleLog in the Arguments tab.
    4. Go to Plug-ins tab, select Launch with: plug-ins selected below only
    5. Deselect All, activate Workspace checkbox, Add Required Plug-insApplyRun
  4. Test the layouter in the new Eclipse instance:
    1. New  Project...  General  Project, name test
    2. Right-click test project  New  Other...  KEG Diagram (TODO: if graphs shall be created in another way, describe it here)
    3. Create a graph using the palette on the right.
    4. Window  Show View  Other...  KIELER  Layout
    5. While the graph diagram is open, set Layout Provider or Type in the Layout view to <Login> Test Layouter.
    6. Open the additional views Layout Graph and Layout Time.
    7. Trigger layout with the KIELER Layout button in the toolbar or Ctrl+R L (first Ctrl+R, then L).
    8. See the direct input and output of your algorithm in the Layout Graph view.
    9. See the execution time analysis in the Layout Time view.
  5. Implement another class EdgeRouter.
    1. Add the following method:
          /**
      * Route the edges that are connected with the children of the given node.
      * @param parentNode the parent node of the input graph
      */
      public void routeEdges(final KNode parentNode) {
      getMonitor().begin("Edge Routing", 1);

      getMonitor().done();
      }
    2. Add the following code to the end of the doLayout method in your layout provider:
              EdgeRouter edgeRouter = new EdgeRouter();
              edgeRouter.routeEdges(layoutNode);
      
    3. Implement the routeEdges method:
      • Each edge shall be drawn with three line segments: one vertical segment starting below the source node, one horizonzal segment, and another vertical segment ending below the target node.
      • The horizontal segments of two different edges shall not have the same y-coordinate; for consecutive edges, the distance between their horizontal segments shall equal objectSpacing.
      • See the attached image test-drawing.png for an example.
      • Find the edges using getOutgoingEdges() or getIncomingEdges() on a node.
      • Get the edge layout of an edge to set bend points using this code:
                KEdgeLayout edgeLayout = edge.getData(KEdgeLayout.class);
        
      • Create a bend point using this code:
                KPoint point = KLayoutDataFactory.eINSTANCE.createKPoint();
        
      • Use the getBendPoints() list on the edgeLayout to add bend points (clear the list first to remove points from the previous layout).
      • Set the values of the points returned by getSourcePoint() and getTargetPoint() according to the positions where the edge leaves its source node and reches its target node.
  6. Use your previous run configuration to test the edge router.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.
Info
titleTips

The following tips might come in handy...

  • Read the documentation of the KGraph and KLayoutData meta models. The input to the layout algorithm is a KNode that has child KNodes for every node in the graph. Iterate over these nodes by iterating over the getChildren() list of the parentNode argument.
  • Retrieve the size of a node and set its position later using the following code:

    Code Block
    languagejava
    KShapeLayout nodeLayout = node.getData(KShapeLayout.class);
    
    // Retrieving the size
    float width = nodeLayout.getWidth();
    float height = nodeLayout.getHeight();
    
    // Setting the position
    nodeLayout.setXpos(x);
    nodeLayout.setYpos(y);
  • objectSpacing is the spacing to be left between each pair of nodes.
  • borderSpacing is the spacing to be left to the borders of the drawing. The top left node's coordinates must therefore be at least (borderSpacing, borderSpacing).
  • At the end of the method, set the width and height of parentLayout such that it is large enough to hold the whole drawing, including borders.
  • A complete layout algorithm will of course also route the edges between the nodes. Ignore that for now – you will do this at a later step.

Before you can test your layout code, you will have to register your new layout provider with KIML.

  1. Open the META-INF/MANIFEST.MF file again and switch to the Extensions tab.
  2. Add an extension for de.cau.cs.kieler.kiml.layout.layoutProviders.
  3. Right-click the extension and click New > layoutAlgorithm.
  4. Set the name to Login_name Test Layouter and the class to your layout provider class name.
  5. Right-click the new layoutAlgorithm and click New > knownOption. Set option to de.cau.cs.kieler.spacing.
  6. Add another knownOption for de.cau.cs.kieler.borderSpacing.
  7. Save the editor.

We will now have to add a new run configuration that will start an Eclipse instance with your layout code loaded into the application, ready to be used.

  1. Click Run > Debug Configurations...
  2. Right-click Eclipse Application and click New. Set the configuration's name to Layout Test.
  3. In the Arguments tab, make sure the the program arguments include -debug and -consoleLog.
  4. On the Plug-ins tab, set Launch with to plug-ins selected below only. Click Deselect All, check the Workspace item in the tree, and click Add Required Plug-ins.
  5. Click Apply to save your changes and then Debug to start an Eclipse instance to test with.

Test the layouter in your new Eclipse instance:

  1. Click New > Project... > General > Project and set the project name to something like Test.
  2. Right-click the new project and click New > Empty KEG Graph. Enter a meaningful name and click Finish.
  3. Put a few nodes into the diagram. To properly test your code, you will want to vary the sizes of the nodes. It may also be a good idea to get into the habit of giving each node a different name, such as N1, N2, etc. This will help you later if you have to debug your algorithm.
  4. Open the Layout view through Window > Show View > Other... > KIELER Layout > Layout.
  5. With your KEG diagram selected, set the Layout Algorithm option in the Layout view to your new algorithm.
  6. Save your KEG diagram.
  7. Trigger automatic layout by clicking the layout button in the toolbar, or by hitting Ctrl+R L (first Ctrl+R, then L).
Info
titleTip

You can see the direct output of your algorithm and the time it took to run it through the Layout Graph and Layout Time views. The views are available through the de.cau.cs.kieler.kiml.debug plug-in, which can be found in the plugins-dev folder of the KIML repository. You will learn more about debugging layout algorithms in a layout tutorial or presentation.

Once you're satisfied with your node placement code, it's time to take care of edge routing.

  1. Add a new method that will implement the edge routing using the following skeleton code:

    Code Block
    languagejava
    /**
     * Routes the edges connecting the nodes in the given graph.
     * 
     * @param parentNode the graph whose edges to route.
     * @param yStart y coordinate of the start of the edge routing area.
     * @param objectSpacing the object spacing.
     * @return height used for edge routing.
     */
    private float routeEdges(final KNode parentNode, final float yStart, final float objectSpacing) {
        // TODO: Implement edge routing
    
        return 0;
    }
  2. Add a call to routeEdges(...) in your doLayout(...) method and implement the latter.
Info
titleTips

Here's a few tips for implementing the edge routing:

  • Each edge shall be drawn with three orthogonal line segments: one vertical segment below the start node, one vertical segment below the target node, and a horizontal segment that connects the two.
  • The horizontal segments of two different edges shall not have the same y-coordinate. Two neighboring horizontal segments shall be placed at a distance of objectSpacing.
  • See the screenshot at the top of the tutorial for an example.
  • Find the edges in a graph by calling getOutgoingEdges() or getIncomingEdges() on the nodes.
  • You can add bend points to edges through the edge's edge layout:

    Code Block
    languagejava
    KEdgeLayout edgeLayout = edge.getData(KEdgeLayout.class);
    KPoint bendPoint = KLayoutDataFactory.eINSTANCE.createKPoint();
    edgeLayout.getBendPoints().add(bendPoint);
  • You will want to clear the list of bend points of each edge layout before adding bend points to it. This will remove all bend points the edge had prior to invoking your layout algorithm.
  • Set the values of the points returned by getSourcePoint() and getTargetPoint() according to the positions where an edge leaves its source node and reaches its target node.
  • If you want, you can improve the edge routing code by allowing horizontal segments to share the same y-coordinate if that doesn't make them overlap. Your goal could be to produce an edge routing that uses as little space as possible.
  • If that's not enough yet: can you find a way to find an order of the horizontal segments such that as few edge crossings as possible are produced?

Once you're done implementing the edge routing code, test it by running your debug configuration again, as before.

Before You Run Away...

...don't forget to commit your layout algorithm to your repository, and to push your commits to the tutorial repository on our server. If it's not there, we won't be able to see your work! (smile)