Java Universal Network/Graph Framework
All examples require JDK 1.4.x or better; Jung2 demos require JDK 1.5.x or better; ensure you have a recent Java plugin installed.
Note: If you have installed a new JRE version over an old one, make sure you update your plug-in settings so that your browser uses the correct JRE. In Windows XP/NT/2k/9x, go to Start→Control Panel→Java Plug-in→Advanced and choose the latest version of the JRE from the drop-down list.
The background image transforms along with the graph.
The old AddNodeDemo, but with animated transitions
The old ShowLayouts demo, but with animated transitions
Tree Node Collapse Demo
Demonstrates how to hide/show children of tree nodes.
Vertex Collapse Demo
Demonstrates how to collapse vertices into a single vertex
Label As Vertex Demo
Demonstrates how to use the vertex labels as the vertex shape.
Lens Vertex Image Demo
Demonstrates the use of a magnifier on a graph using icons for vertices.
Demonstrates an annotations layer for a graph. Draw arbitrary shapes and text over and under the graph visualization.
Demonstrates TreeLayout and an animated transition to RadialLayout
Shows a radial layout for Trees or Forests
Demonstrates Tree Layout and Balloon Layout for a Tree.
Minimum Spanning Tree
Demonstrates how to extract Minimum Spanning Trees from a Graph, configure them with TreeLayout, then display the original graph in a hierarchical form.
Graph Editor Demo
Demonstrates how to create a graph interactively using mouse events; shows the use of the new
Editor graph mouse plugin.
This example shows off many of the capabilities of
PluggableRenderer, a renderer implementation that is designed to
allow the programmer to change a number of different properties of the rendering
of vertices and edges. The source code (in
samples.graph) is also intended to serve as an example of different ways to program using
Multiple View Demo
Demonstrates JUNG's ability to show multiple views of the same graph, and to share transformers between multiple views.
Two Model Demo
Demonstrates JUNG's ability to use two different layouts to simultaneously display the same graph in two views.
Demonstrates transformations of the network visualization, via a "lens" effect. Also shows the difference between model (layout) scaling and view scaling.
Clustering Demo Applet
Demonstrates the ability to perform clustering on graphs, interactively in JUNG. The data set being used here is the Zachary karate club data set, the clustering algorithm being used is Mark Newman's edge betweenness clustering algorithm, and the layout algorithm is Fruchterman-Reingold.
New in version 1.7: also optionally demonstrates visual grouping of vertices in identified clusters.
Edge Label Demo
Demonstrates how to align edge labels to be parallel with edges.
Bipartite Graph Applet
Demonstrates JUNG's ability to create bipartite graphs, to fold them into single-mode graphs, and to interactively visualize user changes to the data. It uses Davis, Gardner, and Gardner's dataset from their 1941 Deep South (as reprinted in Freeman's 2002 paper, figure 1).
Shortest Path Applet
Demonstrates the shortest path algorithms in JUNG. When a user selects two vertices, the system chooses one shortest path between those two vertices and colors it. The graph is randomly generated by
Ranking Demo Applet
Demonstrates several ranking algorithms within JUNG. The vertices are laid out with the Fruchterman-Reingold layout. It is possible to filter out vertices with the lower slider (nodes with low betweeness are removed first), and to scale the vertices with the upper slider.
Add-a-Node Demo Applet
This applet shows an example in which nodes are gradually added one-at-a-time to a display.