Uploaded image for project: 'Kieler Pragmatics'
  1. Kieler Pragmatics
  2. KIPRA-1407

Nodespacingcalculation algorithms should iterate a node's edges

    XMLWordPrintable

    Details

      Description

      The code extracted to kiml.util (NodeMarginCalculator, LabelAndNodeSizeProcessor) iterates over the edges of ports to fulfill some tasks.

      While this is ok for LGraph, as ports are introduced for port-less edges, it is not sufficient for KGraphs where edges may exist without ports.

      The code should consider this by iterating directly over a node's edges where no ports are involved.

      Christoph Daniel if you have time I would be glad if you could do this, otherwise pass the ticket back to me.

        Attachments

          Activity

            People

            Assignee:
            cds Christoph Daniel Schulze [X] (Inactive)
            Reporter:
            uru Ulf Rueegg [X] (Inactive)
            Votes:
            0 Vote for this issue
            Watchers:
            2 Start watching this issue

              Dates

              Created:
              Updated:
              Resolved: