相信一个图可以简单地表示为:

class Node {
   int value;
   List<Node> adj;
}

实现大部分你自己感兴趣的算法。如果您在一些关于图形的练习/学习过程中遇到了这个问题，那么这是最好的库。,)

对于大多数常见算法，你也可以选择邻接矩阵:

class SparseGraph {
  int[] nodeValues;
  List<Integer>[] edges;     
}

或者一些运算的矩阵:

class DenseGraph {
  int[] nodeValues;
  int[][] edges;     
}

Apache Commons提供了Commons -graph。在http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/下可以查看源代码。SVN中也有API使用示例。参见https://issues.apache.org/jira/browse/SANDBOX-458获得实现的算法列表，并与Jung, GraphT, Prefuse, jBPT进行比较

谷歌番石榴如果你只需要好的数据结构。

JGraphT是一个实现了许多算法的图库，并且(在我看来)有一个很好的图模型。Helloworld例子。许可:LGPL + EPL。

JUNG2 is also a BSD-licensed library with the data structure similar to JGraphT. It offers layouting algorithms, which are currently missing in JGraphT. The most recent commit is from 2010 and packages hep.aida.* are LGPL (via the colt library, which is imported by JUNG). This prevents JUNG from being used in projects under the umbrella of ASF and ESF. Maybe one should use the github fork and remove that dependency. Commit f4ca0cd is mirroring the last CVS commit. The current commits seem to remove visualization functionality. Commit d0fb491c adds a .gitignore.

Prefuse使用矩阵结构存储图，这对于稀疏图来说内存效率不高。许可:BSD

Eclipse Zest内置了图形布局算法，可以独立于SWT使用。看到org.eclipse.zest.layouts.algorithms。所使用的图结构是Eclipse Draw2d中的一个，其中节点是显式对象，而不是通过泛型注入的(这发生在Apache Commons graph、JGraphT和JUNG2中)。

图片来源:http://mmengineer.blogspot.com/2009/10/java-graph-floyd-class.html

提供了一个强大的软件来处理图形(直接或非直接)。还生成了Graphivz代码，可以看到图形表示。您可以将自己的代码算法放入包中，例如:回溯代码。该软件包提供了一些算法:Dijkstra，回溯最小路径代价等。

If you were using JGraph, you should give a try to JGraphT which is designed for algorithms. One of its features is visualization using the JGraph library. It's still developed, but pretty stable. I analyzed the complexity of JGraphT algorithms some time ago. Some of them aren't the quickest, but if you're going to implement them on your own and need to display your graph, then it might be the best choice. I really liked using its API, when I quickly had to write an app that was working on graph and displaying it later.

相信一个图可以简单地表示为:

class Node {
   int value;
   List<Node> adj;
}

实现大部分你自己感兴趣的算法。如果您在一些关于图形的练习/学习过程中遇到了这个问题，那么这是最好的库。,)

对于大多数常见算法，你也可以选择邻接矩阵:

class SparseGraph {
  int[] nodeValues;
  List<Integer>[] edges;     
}

或者一些运算的矩阵:

class DenseGraph {
  int[] nodeValues;
  int[][] edges;     
}

JUNG是一个很好的可视化选择，并且也有一组相当不错的可用图算法，包括几种不同的随机图创建、重布线等机制。我还发现，在必要的地方扩展和调整它通常相当容易。