JGraphT portal 02-16-2014d1114
2015-06-16JGraphT portal 02-16-2014d1114
http://jgrapht.org/
Java doc for JgraphT
http://jgrapht.org/javadoc/
JGraphT: focused on data structures and algorithms.
JGraph: focused on rendering and GUI-based editing.
JGraphT libraries located here:
"C:\Users\kurtw_000\Documents\kurt\storage\DR\2014\02-16-2014d1152\jgrapht-0.9.0"
Hellow World JGraphT example
Users mailing list
- email: [email protected]
- password: Joseph with money
- https://lists.sourceforge.net/lists/options/jgrapht-users/kurtwhittemore%40yahoo.com
- welcome email from [email protected] on 5-11-14
- post to list with [email protected]
- -record of jgrapht user mailing list emails 05-11-2014d1351
- Degree of a node with JGraphT
- -public int degreeOf(V vertex)
- -I could use this to generate a degree distribution
- Can't seem to get clustering coefficient
- I can get the average shortest path length
- -http://jgrapht.org/javadoc/org/jgrapht/alg/FloydWarshallShortestPaths.html
- -FloydWarshallShortestPaths(Graph<V,E> graph)
- -getShortestPaths()
- -this code is blazing fast. With the us airport network with about 2,000 edges and 300 nodes the code is basically instantaneous
- -some java code to get average shortest path and diameter of a network 03-07-2014d1702
- I can get the diameter of a graph (longest of all the shortest paths.)
- -http://jgrapht.org/javadoc/org/jgrapht/alg/FloydWarshallShortestPaths.html
- -FloydWarshallShortestPaths(Graph<V,E> graph)
- -getDiameter()
- -this code is blazing fast. With the us airport network with about 2,000 edges and 300 nodes the code is basically instantaneous
See also