| A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
| keepAllSelfloopLayouts — Property, class com.yworks.yfiles.layout.SelfLoopLayouter |
|
Getter:
Returns whether this algorithm should keep the existing layout of all self-loops. |
| keepBends — Property, class com.yworks.yfiles.layout.planar.DrawingEmbedder |
|
Specifies if bends should be replaced by dummy nodes. |
| keepCalculatedPorts — Property, class com.yworks.yfiles.layout.KeepStrongPortConstraintsStage |
|
Specifies whether or not the final edge routes should contain the ports calculated by the core layouter. |
| KEEP_SELF_LOOP_LAYOUT_DPKEY — Constant Static Property, class com.yworks.yfiles.layout.SelfLoopLayouter |
|
This com.yworks.yfiles.base.DataProvider key can be used to register a com.yworks.yfiles.base.DataProvider with the graph to be laid out. |
| KeepStrongPortConstraintsStage — class, package com.yworks.yfiles.layout |
|
This layout stage ensures that layout algorithms that cannot handle port constraints keep the ports of edges with strong port constraints. |
| KeepStrongPortConstraintsStage(init:Boolean) — Constructor, class com.yworks.yfiles.layout.KeepStrongPortConstraintsStage |
|
Creates a new instance of this layout stage. |
| key — Property, interface com.yworks.bridge.util.MapEntry |
|
Gets the key. |
| key — Property, class com.yworks.yfiles.layout.hierarchic.WeightedLayerer |
|
The key to access the weights. |
| keySet() — method, class com.yworks.bridge.util.AbstractMap |
|
Answers a Set of the keys contained in this Map. |
| keySet() — method, class com.yworks.bridge.util.HashMap |
|
Answers a Set of the keys contained in this HashMap. |
| keySet() — method, interface com.yworks.bridge.util.Map |
|
Answers a Set of the keys contained in this Map. |
| keySet() — method, class com.yworks.bridge.util.TreeMap |
|
Answers a Set of the keys contained in this spec.TreeMap. |
| kruskal(graph:com.yworks.yfiles.base:Graph, cost:com.yworks.yfiles.base:DataProvider) — Static Method , class com.yworks.yfiles.algo.SpanningTrees |
|
Calculates a minimum spanning tree for the given graph. |
| kShortestPaths(graph:com.yworks.yfiles.base:Graph, costDP:com.yworks.yfiles.base:DataProvider, start:com.yworks.yfiles.base:Node, end:com.yworks.yfiles.base:Node, k:int) — Static Method , class com.yworks.yfiles.algo.ShortestPaths |
|
This method finds the k shortest paths connecting a pair of nodes in a directed graph with non-negative edge costs. |
| kShortestPathsCursor(graph:com.yworks.yfiles.base:Graph, costDP:com.yworks.yfiles.base:DataProvider, start:com.yworks.yfiles.base:Node, end:com.yworks.yfiles.base:Node, k:int) — Static Method , class com.yworks.yfiles.algo.ShortestPaths |
|
A variant of kShortestPaths() that returns its result not as a list but as a special cursor that calculates the next path in the sequence only when needed. |
|
| A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
