subgraphs graphs that are auto-updating subgraph views on
other graphs.

all compositions of above graphs.

Although powerful, JGraphT is designed to be simple
and type-safe (via Java generics). For example,
graph vertices can be of any objects. You can create graphs based on: Strings,
URLs, XML documents, etc; you can even create graphs of graphs! This
code example shows how.

There are two downloads, one for Windows-based systems, and one for
Linux/Unix-based systems. The downloads contain identical Java source
code and a README.md file to help you to get started.
Starting with version 1.0.0, JDK 1.8 is required at a minimum (earlier versions with less functionality can be used on older
JDK's/JRE's).

The
JavaDoc files
are available online. They are also included in the downloads so you
can view them locally.

Support

Report a bug you might have found in JGraphT using the
issue
tracker, or request an enhancement.

If you are reporting a bug, please describe a reproducing scenario. If
possible, attach a small program with a description of what is wrong and
needs fixing.

If you need a bug fixed really urgently, use the source...

There is also
a wiki
set up for everyone in the JGraphT community to share information
about the project.

JGraphT and JGraph

JGraphT and JGraph are two different libraries which are intended for different purposes.

JGraphT:

is focused on data structures and algorithms.

JGraph:

is focused on rendering and GUI-based editing.

The two libraries are complementary and can be used together via
the JGraphModelAdapter provided by JGraphT; this adapter allows a
JGraphT graph data structure to be used as the model being viewed and
controlled via JGraph.

Your Improvements

If you add new features or fix bugs please
send us your updates.
We will add them to the next release of JGraphT
so everyone can enjoy your contribution. You might also benefit from it:
others may fix hidden bugs in your code or may contribute new features.

If you wish to join the JGraphT team, please
send us a few words about yourself - we'll be happy to grow!