***** To join INSNA, visit http://www.sfu.ca/~insna/ *****
The JUNG (Java Universal Network/Graph) project is proud to announce the
release of JUNG 1.1. New features in JUNG 1.1 include:
* Native support for bipartite graphs (useful for affiliation
networks), and an ability to "fold" bipartite graphs into one-mode graphs
* A community-finding algorithm, the "Exact Flow" algorithm (Flake,
Lawrence, et al 2002)
* Several new Betweenness measures, including Random Walk Betweeness
* A new random graph generator, Watt's beta model
* and seven other new algorithms (above the several dozen released in
JUNG is a free, open-source programming framework for implementing graph
and social network solutions in Java. It is intended for programmers who
are interested in being able to programatically manipulate graphs, by
iterating commands on them, dynamically modifying them, and visualizing
the results. While the JUNG framework provides many algorithms and tools
for graphs, it allows many other possible uses, and allows you to add
your own algorithms.
JUNG has been successfully used...
... to create visual applets
... to read data from JDBC (database) connections
... to handle social network datasets, including very large (100,000
plus nodes) ones
... to write out data that can be read by PAJEK and UCINET
... for stastical analyses, network measures, and visualizations
We invite you to try out JUNG, and to let us know whether you find it
helpful. We are also looking to expand our body of code and alogrithms,
and would be delighted to have your contributions..
on behalf of the JUNG Development Team
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.sfu.ca/~insna/). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.