Last modified by Richard Kreissig on 2023/09/14 10:20
<
From version < 6.1 >
edited by cds
on 2013/06/03 11:27
To version < 4.1 >
edited by cds
on 2013/06/02 15:53
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -418,7 +418,7 @@
418 418  Default
419 419  )))
420 420  |(((
421 -[[Crossing Minimization>>doc:||anchor="crossingMinimizat"]]
421 +Crossing Minimization
422 422  )))|(((
423 423  de.cau.cs.kieler.klay.layered.crossMin
424 424  )))|(((
... ... @@ -429,7 +429,7 @@
429 429  LAYER_SWEEP
430 430  )))
431 431  |(((
432 -[[Cycle Breaking>>doc:||anchor="cycleBre"]]
432 +Cycle Breaking
433 433  )))|(((
434 434  de.cau.cs.kieler.klay.layered.cycleBreaking
435 435  )))|(((
... ... @@ -441,7 +441,6 @@
441 441  )))
442 442  |(((
443 443  Distribute Nodes
444 -(currently unsupported)
445 445  )))|(((
446 446  de.cau.cs.kieler.klay.layered.distributeNodes
447 447  )))|(((
... ... @@ -452,7 +452,7 @@
452 452  false
453 453  )))
454 454  |(((
455 -[[Edge Spacing Factor>>doc:||anchor="edgeSpacingFactor"]]
454 +Edge Spacing Factor
456 456  )))|(((
457 457  de.cau.cs.kieler.klay.layered.edgeSpacingFactor
458 458  )))|(((
... ... @@ -496,7 +496,7 @@
496 496  )))
497 497  |(% colspan="1" %)(% colspan="1" %)
498 498  (((
499 -[[Interactive Reference Point>>doc:||anchor="interactiveReferencePoi"]]
498 +Interactive Reference Point
500 500  )))|(% colspan="1" %)(% colspan="1" %)
501 501  (((
502 502  de.cau.cs.kieler.klay.layered.interactiveReferencePoint
... ... @@ -602,7 +602,7 @@
602 602  
603 603  )))
604 604  |(((
605 -[[Thoroughness>>doc:||anchor="thorough"]]
604 +Thoroughness
606 606  )))|(((
607 607  de.cau.cs.kieler.klay.layered.thoroughness
608 608  )))|(((
... ... @@ -623,10 +623,6 @@
623 623  
624 624  == Crossing Minimization ==
625 625  
626 -
627 -
628 -{{id name="crossingMinimization"/}}
629 -
630 630  Crossing minimization determines the ordering of nodes in each layer, which influences the number of edge crossings. This option switches between one of several algorithms that can be used to minimize crossings. Possible values are:
631 631  
632 632  * LAYER_SWEEP
... ... @@ -634,37 +634,10 @@
634 634  * INTERACTIVE
635 635  Orders the nodes of each layer by comparing their positions before the layout algorithm was started. The idea is that the relative order of nodes as it was before layout was applied is not changed. This of course requires valid positions for all nodes to have been set on the input graph before calling the layout algorithm. The interactive layer sweep algorithm uses the //Interactive Reference Point// option to determine which reference point of nodes are used to compare positions.
636 636  
637 -== Cycle Breaking ==
638 -
639 -
640 -
641 -{{id name="cycleBreaking"/}}
642 -
643 -KLay Layered tries to position nodes in a way that all edges point rightwards. This is not possible if the input graph has cycles. Such cycles have to be broken by reversing as few edges as possible. The reversed edges end up pointing leftwards in the resulting diagram. There are different cycle breaking algorithms available:
644 -
645 -* GREEDY
646 -This algorithm reverses edges greedily. The algorithm tries to avoid edges that have the //Priority// property set.
647 -* INTERACTIVE
648 -The interactive algorithm tries to reverse edges that already pointed leftwards in the input graph. This requires node and port coordinates to have been set to sensible values.
649 -
650 -== Edge Spacing Factor ==
651 -
652 -
653 -
654 -{{id name="edgeSpacingFactor"/}}
655 -
656 -The edge spacing factor determines the amount of space between edges, relative to the regular //Spacing// value. The idea is that we don't need as much space between edges as we do between nodes.
657 -
658 -[[image:attach:edgeSpacingFactor.png]]
659 -
660 660  == Interactive Reference Point ==
661 661  
634 +Interactive layering and crossing minimization algorithms use node positions to sort nodes into layers or to determine the order of nodes in each layer. However, it is unclear if for example the top left corners of nodes should be compared, or the bottom left corners — different settings might lead to different results. The interactive reference point determines which part of nodes is used to compare their positions. It provides the following settings:
662 662  
663 -
664 -{{id name="interactiveReferencePoint"/}}
665 -
666 -Interactive layering, crossing minimization, and cycle breaking algorithms use node positions to sort nodes into layers or to determine the order of nodes in each layer. However, it is unclear if for example the top left corners of nodes should be compared, or the bottom left corners — different settings might lead to different results. The interactive reference point determines which part of nodes is used to compare their positions. It provides the following settings:
667 -
668 668  * TOP_LEFT
669 669  The top left corner of a node is taken as the reference point.
670 670  * CENTER
... ... @@ -672,8 +672,4 @@
672 672  
673 673  == Thoroughness ==
674 674  
675 -
676 -
677 -{{id name="thoroughness"/}}
678 -
679 679  There are heuristics in use all over KLay Layered whose results often improve with the number of iterations computed. The thoroughness is a measure for telling KLay Layered to compute more iterations to improve the quality of results, at the expense of performance.
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -7111116
1 +7111105
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/7111116/KLay Layered Layout Options
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/7111105/KLay Layered Layout Options

Navigation

Quick Links

KIELER on GitHub
RTSYS Homepage