All Classes and Interfaces
Class
Description
The abstract base class for all cell views.
A map specifically for the storage of attributes of graph cells.
The basic Linvalid input: '&F' for a graph data structure.
A simple implementation of a marquee handler for JGraph.
Interpolates given points by a bezier curve.
JGraphpad graph constants.
Defines the requirements for objects that may be used as handles.
Defines the requirements for objects that may be used as a cell mapper.
Defines the requirements for an object that
represents a view for a model cell.
Defines the requirements for objects that may be used as a
cell view factory.
Defines the requirements for objects that may be used as a
cell view renderer.
An object that represents a set of connections.
Object that represents the connection between an edge and a port.
The default implementation of a cell view factory that returns the default
views for vertices, edges and ports.
A simple implementation for an edge.
The default implementation for the GraphCell interface.
The default implementation of a graph model.
Default implementation of GraphSelectionModel.
A simple implementation for a port.
The default editor for graph cells.
Defines the requirements for an object that represents an Edge in a
GraphModel.
This renderer displays entries that implement the CellView interface.
The default implementation of an edge view.
The interface executable changes must adhere to
Defines the requirements for objects that appear as
GraphCells.
Adds to CellEditor the extensions necessary to configure an editor
in a graph.
A collection of well known or common attribute keys and methods to apply to
an Map to get/set the properties in a typesafe manner.
An object that defines the view of a graphmodel.
Encapsulates information describing changes to a graph layout cache, and is
used to notify graph layout cache listeners of the change.
Defines the interface for objects that may be used to represent a change
to the graph layout cache.
Defines the interface for an object that listens to changes in a GraphModel.
The interface that defines a suitable data model for a JGraph.
Encapsulates information describing changes to a graph model, and is used to
notify graph model listeners of the change.
Defines the interface for objects that may be included into a
GraphModelEvent to describe a model change.
Defines the interface for an object that listens to changes in a GraphModel.
An event that characterizes a change in the current selection.
The listener that's notified when the selection in a GraphSelectionModel
changes.
This interface represents the current state of the selection for
the graph component.
An object that represents the clipboard contents for a graph selection.
Pluggable look and feel interface for JGraph.
An UndoManager that may be shared among multiple GraphLayoutCache's.
A control that displays a network of related objects using the well-known
paradigm of a graph.
EmptySelectionModel is a GraphSelectionModel
that does not allow anything to be selected.An abstraction of an internal hierarchy node or edge
An implementation of a basic tree layout.
A singleton class that provides algorithms for graphs.
Deprecated.
use JGraphOrganicLayout instead
The compact tree layout is a Moen layout, which concentrates on making the
graph as compact as possible whilst still allowing correctly for varations in
node shapes and sizes
The paper by Moen is called "Drawing Dynamic Trees" and may be purchased from
http://csdl.computer.org/comp/mags/so/1990/04/s4021abs.htm
This allows to recursively compose any number of abstract layouts into a
compound abstract layout.
This allows to recursively compose any number of abstract layouts into a compound
abstract layout.
Sets the horizontal locations of node and edge dummy nodes on each layer.
The cost function takes a cell and returns it's cost as a double.
This class implements a priority queue.
An abstract description of a graph that can be used by a layout algorithm.
Defines the interface that visitors use to perform operations upon the
graph information during depth first search (dfs) or other tree-traversal
strategies implemented by subclassers.
This layout is an implementation of "Graph Drawing by Force-Directed
Placement" by Fruchterman and Reingold (1991).
This class implements a priority queue.
Implements a node of the Fibonacci heap.
Deprecated.
use JGraphFastOrganicLayout instead
A Greedy Cycle removal algorithm for pre-processing cyclic graphs prior to
applying a hierarchical layout.
The top level compound layout of the hierarchical layout.
The specific layout interface for hierarchical layouts.
An abstraction of a hierarchical edge for the hierarchy layout
Internal model of a hierarchical graph.
An abstraction of an internal node in the hierarchy layout
An abstraction of a rank in the hierarchy layout.
Deprecated.
use JGraphSelfOrganizingOrganicLayout instead
The class that defines a layout algorithm.
An additional interface that should be implemented if a layout is
expected to run longer.
Describes the state of a long-running layout.
An implementation of the first stage of the Sugiyama layout.
Performs a vertex ordering within ranks as described by Gansner et al 1993
An implementation of the first stage of the Sugiyama layout.
An abstract description of a graph that can be used by a layout algorithm.
Deprecated.
use JGraphCompactTreeLayout instead
A network simplex layering algorithm as described by Gansner et al 1993
An implementation of a simulated annealing layout, based on "Drawing Graphs
Nicely Using Simulated Annealing" by Davidson and Harel (1996).
Algorithm which create intermediates points for parallel edges.
Wrapper panel for a diagram/JGraph-pair that implements automatic sizing,
backgrounds, printing and undo support.
Lays out the nodes in a graph as a radial tree (root at the centre, children
in concentric ovals).
This layout is an implementation of inverted self-organising maps as
described by Bernd Meyer in his 1998 paper "Self-Organizing Graphs - A Neural
Network Perspective of Graph Layout".
Three simple layouts in one class.
Deprecated.
use JGraphFastOrganicLayout instead
An implementation of a basic tree layout.
Implements a union find structure that uses union by rank and path
compression.
Universal renderer for vertices and groups.
Vertex view that supports
rendering and
in-place editing, that means it supports simple text, rich text and component
values.
invalid reference
JGraphpadBusinessObjectA simple organisational chart.
Tool that inserts vertices based on a prototype.
A routing algorithm that
An object that describes relations between childs and parents.
Defines the requirements for an object that
represents a port in a graph model.
This renderer displays entries that implement the CellView interface and
supports the following attributes:
GraphConstants.OFFSET GraphConstants.ABSOLUTE invalid input: '<'/li
The default implementation of a port view.
In-place editor for rich text multiline values.
User object with a dynamic set of properties in a hashtable.
In-place editor for rich text multiline values.
GraphModel that supports cloning of
and
handles custom entries in nested maps to add/change/remove properties for
business object (using the model's insert and edit methods).
invalid reference
JGraphpadBusinessObjectRich text replacement for string values in
RichTextBusinessObject.A simple grid layout algorithm that takes the specified vertices and
arranges them in rectangular fashion
Interpolates given values by B-Splines.
Interpolates points given in the 2D plane.
Various utility methods to assist producing an SVG representation of the
graph
This renderer displays entries that implement the CellView interface and
supports the following attributes.
The default implementation of a vertex view.