Summary

• Page properties (1 modified, 0 added, 0 removed)
• Objects (1 modified, 0 added, 0 removed)
  • Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Content

...	...	@@ -437,7 +437,7 @@
437	437	Dependency
438	438	)))
439	439	|(((
440		-[[Crossing Minimization>>doc:||anchor="crossingMinimizat"]]
	440	+[[Crossing Minimization>>doc:||anchor="crossingMinimization"]]
441	441	)))|(((
442	442	de.cau.cs.kieler.klay.layered.crossMin
443	443	)))|(((
...	...	@@ -499,7 +499,7 @@
499	499	)))
500	500	|(% colspan="1" %)(% colspan="1" %)
501	501	(((
502		-[[Fixed Alignment>>doc:||anchor="fixed"]]
	502	+[[Fixed Alignment>>doc:||anchor="fixedAlignment"]]
503	503	)))|(% colspan="1" %)(% colspan="1" %)
504	504	(((
505	505	de.cau.cs.kieler.klay.layered.fixedAlignment
...	...	@@ -518,7 +518,7 @@
518	518	)))
519	519	|(% colspan="1" %)(% colspan="1" %)
520	520	(((
521		-[[Interactive Reference Point>>doc:||anchor="interactiveReferencePoi"]]
	521	+[[Interactive Reference Point>>doc:||anchor="interactiveReferencePoint"]]
522	522	)))|(% colspan="1" %)(% colspan="1" %)
523	523	(((
524	524	de.cau.cs.kieler.klay.layered.interactiveReferencePoint
...	...	@@ -575,7 +575,7 @@
575	575	)))
576	576	|(% colspan="1" %)(% colspan="1" %)
577	577	(((
578		-[[Merge Edges>>doc:||anchor="merge"]]
	578	+[[Merge Edges>>doc:||anchor="mergeEdges"]]
579	579	)))|(% colspan="1" %)(% colspan="1" %)
580	580	(((
581	581	de.cau.cs.kieler.klay.layered.mergePorts
...	...	@@ -594,7 +594,7 @@
594	594	)))
595	595	|(% colspan="1" %)(% colspan="1" %)
596	596	(((
597		-[[Merge Hierarchy-Crossing Edges>>doc:||anchor="mergeHierarchyE"]]
	597	+[[Merge Hierarchy-Crossing Edges>>doc:||anchor="mergeHierarchyEdges"]]
598	598	)))|(% colspan="1" %)(% colspan="1" %)
599	599	(((
600	600	de.cau.cs.kieler.klay.layered.mergeHierarchyPorts
...	...	@@ -627,7 +627,7 @@
627	627	)))
628	628	|(% colspan="1" %)(% colspan="1" %)
629	629	(((
630		-[[Node Placement>>doc:||anchor="nodePL"]]
	630	+[[Node Placement>>doc:||anchor="nodePlacement"]]
631	631	)))|(% colspan="1" %)(% colspan="1" %)
632	632	(((
633	633	de.cau.cs.kieler.klay.layered.nodePlace
...	...	@@ -664,7 +664,7 @@
664	664
665	665	)))
666	666	|(((
667		-[[Thoroughness>>doc:||anchor="thorough"]]
	667	+[[Thoroughness>>doc:||anchor="thoroughness"]]
668	668	)))|(((
669	669	de.cau.cs.kieler.klay.layered.thoroughness
670	670	)))|(((
...	...	@@ -783,10 +783,10 @@
783	783
784	784	{{id name="mergeEdges"/}}
785	785
786		-{{warning}}
787		-Document!
788		-{{/warning}}
	786	+In the KGraph model, edges can either connect to nodes through ports or directly. In the latter case, KLay Layered will introduce a virtual port for each edge, which results in all edges connecting to the node at different points in the final drawing. If this option is switched on, KLay Layered will only generate up to one input and one output port for each node. The option is set on a parent node and applies to all of its children, but not to the parent node itself.
789	789
	788	+[[image:attach:merging.png]]
	789	+
790	790	== Merge Hierarchy-Crossing Edges ==
791	791
792	792
...	...	@@ -803,10 +803,15 @@
803	803
804	804	{{id name="nodeLayering"/}}
805	805
806		-{{warning}}
807		-Document!
808		-{{/warning}}
	806	+Decides which algorithm is used to compute the layer each node is placed in. We have different algorithms available, with different optimization goals:
809	809
	808	+* NETWORK_SIMPLEX
	809	+This algorithm tries to minimize the length of edges. This is the most computationally intensive algorithm. The number of iterations after which it aborts if it hasn't found a result yet can be set with the [[Maximal Iterations>>doc:||anchor="maximalInterations"]] option.
	810	+* LONGEST_PATH
	811	+A very simple algorithm that distributes nodes along their longest path to a sink node.
	812	+* INTERACTIVE
	813	+Distributes the nodes into layers by comparing their positions before the layout algorithm was started. The idea is that the relative horizontal 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 node layering algorithm uses the //Interactive Reference Point// option to determine which reference point of nodes are used to compare positions.
	814	+
810	810	== Node Placement ==
811	811
812	812

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-9470049
	1	+9470076

URL

...	...	@@ -1,1 +1,1 @@
1		-https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470049/KLay Layered Layout Options
	1	+https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9470076/KLay Layered Layout Options