Reference to the enclosing Graph.
The parent cell of the layout, if any
Boolean indicating if the bounding box of the label should be used if it iss available.
Shortcut to Graph#updateGroupBounds with moveGroup set to true.
Implements GraphLayout.execute
Returns the constraint for the given key and cell. The optional edge and source arguments are used to return inbound and outgoing routing- constraints for the given edge and vertex. This implementation always returns the value for the given key in the style of the given cell.
Key of the constraint to be returned.
Cell whose constraint should be returned.
Optionaledge: CellOptional Cell that represents the connection whose constraint should be returned. Default is null.
Optionalsource: booleanOptional boolean that specifies if the connection is incoming or outgoing. Default is null.
Returns an Rectangle that defines the bounds of the given cell or the bounding box if useBoundingBox is true.
Returns a boolean indicating if the given Cell should be ignored by the algorithm. This implementation returns false for all vertices.
Returns a boolean indicating if the given Cell should be ignored by the algorithm. This implementation returns false for all vertices.
Returns a boolean indicating if the given Cell is movable or bendable by the algorithm. This implementation returns true if the given cell is movable in the graph.
Disables or enables the edge style of the given edge.
Disables or enables orthogonal end segments of the given edge.
Sets the new position of the given cell taking into account the size of the bounding box if useBoundingBox is true. The change is only carried out if the new location is not equal to the existing location, otherwise the geometry is not replaced with an updated instance. The new or old bounds are returned (including overlapping labels).
Traverses the (directed) graph invoking the given function for each visited vertex and edge. The function is invoked with the current vertex and the incoming edge as a parameter. This implementation makes sure each vertex is only visited once. The function may return false if the traversal should stop at the given vertex.
Example:
GlobalConfig.logger.show();
const cell = graph.getSelectionCell();
graph.traverse(cell, false, function(vertex, edge)
{
GlobalConfig.logger.debug(graph.getLabel(vertex));
});
Extends GraphLayout to implement an edge label layout. This layout makes use of cell states, which means the graph must be validated in a graph view (so that the label bounds are available) before this layout can be executed.