The visualization display will show the graph in a new window or in a new tab of a previously created graph window.
The toggle button, when 'set' will cause a focused vertex (red arrow) to be scrolled to the center of the view
The toggle button, when 'set' will allow the user to draw a free-form shape that encloses the vertices they wish to select.
The toggle button, when 'set' will open a satellite mini view of the graph in the lower right corner. The mini-view can be manipulated with the mouse to affect the main view
The button will reset any visual transformations on the graph and center it at a best-effort size
The toggle button, when 'set' will open a rectangular magnification lens in the graph view
- MouseButton1 click-drag on the lens center circle to move the magnifier lens
- MouseButton1 click-draw on a lens edge diamond to resize the magnifier lens
- MouseButton1 click on the upper-right circle-cross to dispose of the magnifier lens
- MouseWheel will change the magnification of the lens
The button will open a Filter dialog. Select buttons in the dialog to hide specific vertices or edges in the display.
The Filter dialog buttons are created by examining the graph vertex/edge properties to discover candidates for filtering.
The Arrangement menu is used to select one of several graph layout algorithms.
- Compact Hierarchical is the TidierTree Layout Algorithm. It builds a tree structure and attempts to reduce horizontal space.
- Hierarchical is a basic Tree algorithm. It prioritizes 'important' edges while constructing the tree.
- Compact Radial is the TidierTree Layout Algorithm with the root(s) at the center and child vertices radiating outwards.
- Hierarchical MinCross is the Sugiyama Layout Algorithm. It attempts to route edges around vertices in order to reduce crossing.There are four layering algorithms:
- Top Down - biases the vertices to the top
- Longest Path - biases the vertices to the bottom
- Network Simplex - layers after finding an 'optimal tree'
- Coffman Graham - biases the vertices using a scheduling algorithm to minimize length
- Circle will arrange vertices in a Circle. If there are not too many edges (less than specified in the jungrapht.circle.reduceEdgeCrossingMaxEdges property with a default of 200), it will attempt to reduce edge crossing by rearranging the vertices.
- Force Balanced is a Force Directed Layout Algorithm using the the Kamada Kawai approach. It attempts to balance the graph by considering vertices and edge connections.
- Force Directed is a Force Directed Layout Algorithm using the Fructermann Reingold approach. It pushes unconnected vertices apart and draws connected vertices together.
- Radial is a Tree structure with the root(s) at the center and child vertices radiating outwards.
- Balloon is a Tree structure with the root(s) at the centers of circles in a radial pattern
- GEM is a Force Directed layout with locally separated components
Standard Popup Actions
- Hide Selected - Causes the display to not show selected vertices.
- Hide Unselected - Causes the display to not show unselected vertices.
- Invert Selection - Unselects all selected nodes and selects all unselected nodes.
- Grow Selection From Sources - Adds to the selection all vertices that have outgoing edges to the current selection.
- Grow Selection To Targets - Adds to the selection all vertices that have incoming edges from the current selection.
- Display Selected As New Graph - Creates a new graph and display from the currently selected vertices.
Vertex Popup Actions
- Select Vertex - Selects the vertex that this action was invoked on.
- Deselect Vertex - Deselects the vertex that this action was invoked on.
Edge Popup Actions
- Go To Edge Source - Makes this edge's source vertex be the focused vertex.
- Go To Edge Target - Makes this edge's destination vertex be the focused vertex.
- Select Edge - Add this edge and its associated vertices to the selection
- Deselect Edge - Removes this edge and its associated vertices from the selection