Summary

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

Details

Page properties

Content

...	...	@@ -480,6 +480,25 @@
480	480	)))
481	481	|(% colspan="1" %)(% colspan="1" %)
482	482	(((
	483	+[[Edge Label Side Selection>>doc:||anchor="edgeLabelSideSelection"]]
	484	+)))|(% colspan="1" %)(% colspan="1" %)
	485	+(((
	486	+de.cau.cs.kieler.klay.layered.edgeLabelSideSelection
	487	+)))|(% colspan="1" %)(% colspan="1" %)
	488	+(((
	489	+Enum
	490	+)))|(% colspan="1" %)(% colspan="1" %)
	491	+(((
	492	+Parents
	493	+)))|(% colspan="1" %)(% colspan="1" %)
	494	+(((
	495	+SMART
	496	+)))|(% colspan="1" %)(% colspan="1" %)
	497	+(((
	498	+
	499	+)))
	500	+|(% colspan="1" %)(% colspan="1" %)
	501	+(((
483	483	[[Feedback Edges>>doc:||anchor="feedbackEdges"]]
484	484	)))|(% colspan="1" %)(% colspan="1" %)
485	485	(((
...	...	@@ -722,6 +722,18 @@
722	722
723	723	[[image:attach:edgeSpacingFactor.png]]
724	724
	744	+== Edge Label Side Selection ==
	745	+
	746	+
	747	+
	748	+{{id name="edgeLabelSideSelection"/}}
	749	+
	750	+{{warning}}
	751	+Document!
	752	+{{/warning}}
	753	+
	754	+
	755	+
725	725	== Feedback Edges ==
726	726
727	727
...	...	@@ -803,10 +803,15 @@
803	803
804	804	{{id name="nodeLayering"/}}
805	805
806		-{{warning}}
807		-Document!
808		-{{/warning}}
	837	+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
	839	+* NETWORK_SIMPLEX
	840	+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.
	841	+* LONGEST_PATH
	842	+A very simple algorithm that distributes nodes along their longest path to a sink node.
	843	+* INTERACTIVE
	844	+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.
	845	+
810	810	== Node Placement ==
811	811
812	812

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-9470053
	1	+9470132

URL

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