Image Gallery

Symmetric graph drawing illustrating the BBC News Agency website map.	Hierarchical layout used to help public safety personnel identify a suspect as a criminal.	Circular graph drawing illustrating a narcotics network that helps identify and document major power players as well as small-time dealers within a drug distribution ring.
Hierarchical graph drawing representing typical configuration of a storage area network.	Symmetric graph drawing representing a typical network comprising terminals, servers, bridges, and routers. Ideal for monitoring networks and extensive management applications.	Compact graph drawing of classes and their relationships adeptly calculated with Tom Sawyer's orthogonal layout algorithm.
Node text enhances this circular graph drawing.	Hierarchical graph drawing depicting the Sopranos family tree. It uses colored nodes to differentiate separate lineages. Orthogonal edge routing creates a clear organizational view and horizontal edge routings illustrate couples.	Circular graph drawing with color-coded clusters.
Annotated nodes and node labels enhance this circular graph drawing.	Orthogonal graph drawing illustrating a circuit design diagram.	An orthogonal graph drawing taken from the domain of robotics design shows how hyper edges (edges between more than two nodes) can be rendered and laid out.
Nested graph drawing organizing and visualizing a workflow task process.	A circular graph drawing revealing networks of cluster trees radiating from a central hub cluster.	Five distinct clusters are revealed when circular layout is applied to this graph drawing.
Hierarchical graph drawing organizing switches, computers, tapes, and disk arrays.	Nesting enables any node and edge to contain subgraphs. Additionally, each nested drawing within the same drawing can have its own individual layout style.	Nested graph drawing illustrating a nested UML diagram.
Orthogonal graph drawing organizing classes and their relationships.	Circular graph drawing with multicolor clusters.	Vast symmetric graph drawing illustrating the CNN website map.
Before Orthogonal graph drawing prior to folding the second row of nested drawings.	After The second row of nested graph drawings has been folded into three folders. An incremental orthogonal layout is then applied to produce a compact nested diagram containing the three folded graphs.	Hierarchical graph drawing with orthogonal routing using JComponents with drop-down list boxes to illustrate the team matches in the NBA playoffs.
Before Hierarchical graph drawing prior to folding into four small folders.	After Hierarchical graph drawing after folding into four small folders.	You can control the placement of labels in a graph drawing. You can configure labels to be near the source, center, or target of a particular edge route. Labels can also be set to the left or right of an edge route, or confined to a narrow region within or outside of a particular node.
Before This simply structured symmetric graph drawing is hiding a more complex structure under each of its nodes.	After Entire symmetric graph drawing after the hidden nodes and edges are revealed.	Graph drawing chronicling a sequence of events in a movie chase scene. User-defined constraints create two rows of sequence nodes, clearly illustrating the directional flow of events. The red node, which denotes a rejected sequence, contains a nested graph drawing that provides the details of the proposed problem sequence.
Symmetric layout is especially well suited to handle very large graphs.	Hierarchical graph drawing illustrating a complex nested diagram.	Graph drawing illustrating nesting.
This graph drawing demonstrates the efficiency of the packing algorithm, which tightly places groups of connected components.	You can control how edges attach to nodes.	Graph drawing illustrating the flexibility of the edge router. The edges on the right adhere to a user constraint that requires them to enter their destination nodes from the right side, while incident edges of the green node are forced to attach to it on the bottom.
Before Sometimes the best path from source to target is not immediately obvious, as this maze example illustrates. Intelligent edge routing technology finds the best path from the start node to the end node.	After After applying edge routing functionality, the best path from source to target is quickly revealed.	Curved edge routes can be used to represent connections between nodes.
A hierarchical graph drawing that uses simultaneous constraints to show which different colored nodes are connected to blue nodes.	Hierarchical graph drawing using several constraints to govern node placement. Some of the nodes must be placed adjacent to each other, some must be located above others, and in some instances the drawing must maintain a specified vertical distance between certain nodes.	Orthogonal graph drawing utilizing constraints to place the green nodes below the blue nodes, maintaining a specified distance between these two groups of nodes. The yellow nodes are constrained to be adjacent to blue nodes and adhere to the default orthogonal layout.
Orthogonal graph drawing indicates the placement of the source and target nodes. Labeling functionality accommodates the space needed to label the drawing.	The bundle of multiedges from node A to node B is constrained to be routed through all other nodes.	Top-to-bottom sequence constraints are used to fix the order of nodes in each column, and three vertical alignment constraints are used to align the three columns.
Symmetric graph drawing representing intricately related objects and their specific relationships.	Constraints fix the exact position of certain nodes and contain some nodes within a specified rectangular region.	Symmetric graph drawing representing objects and their complex relationships clearly.
Circular layout with multiple clusters.	Graph drawing representing a network of major flight hubs across Europe.	Graph drawing showing the various routes of a low-cost American air carrier.