News

GraphStream will be present at SOMC, a satellite meeting of the European Conference on Complex Systems, 3-7 September in Brussels.

Dear users, The mailing list server get actually some troubles, so emails sent on the lists will not be distributed. It should be back soon. Sorry for the inconvenience.

A new NetLogo extension connecting NetLogo and GraphStream is available. Documentation and download here

GraphStream participates in the 6^th Complex Systems Summer School in Paris. Our lectures and materials are available here.

The GraphStream team is organizing a one day meeting, the Dynamic Network Day (DND), with the purpose to gather some of the actual available tools and software available in the field of complex networks analysis and exploration.

Check the ISCN (Institute for Complex Systems in Normandy) and ISC-PIF (Institute for Complex Systems in Paris)

This year The Gephi project invited us to participate to their Google Summer of Code. We have the pleasure to co-mentor the project with André Panisson from ISI Foundation, Turin.

We are happy to announce a new minor release of GraphStream stable version, 1.1. We hope it will fulfill your needs and that you will enjoy the new features that come with it. As usual, please do not hesitate to provide us with your comments through the mailing list and to submit bugs on the issue tracking system.

What is new in release 1.1?

• GraphStream 1.1 supports most of the commonly used graph file formats (DOT, GML, GEXF, Pajek, GraphML, TLP). It can read files in these formats thus making the interface with other graph libraries easier. Some of these parsers (DOT, GML, Pajek, TLP) are (re)written using a JavaCC grammar to reproduce the exact format specifications.
• There is a new way to access graph elements (nodes and edges) by index in addition to the access by identifier. The access by index is faster and allows easy interfacing with APIs that use arrays.
• New methods are added to Graph and Node interfaces for more flexibility. In general, there are three ways to pass a graph element to a method: by id, by index and by reference.
• The Graph implementations (AdjacencyListGraph, SingleGraph and MultiGraph) were completely rewritten. The common code (Sink and Source implementation) was refactored. The new implementations are more stable and provide faster access and iteration (especially breadth-first and depth-first iteration) with almost no memory overhead.
• Concept of "Camera" has been extracted from the previous implementation. With this new version, each view of a viewer has to return a camera object. This object allows to get informations about the view (view center, zoom, etc ...), to control this view and to convert pixels to graphic units and vice-versa.
• There is a new directive in the DGS specifications. This directive, called "cl", is linked to the "graphCleared()" event of a sink.
• Dijkstra's algorithm was reimplemented. The new implementation is much faster. The API has slightly changed.
• With the help of our users many bugs were detected and fixed. Special thanks to all of them for their feedback.

With the new release 1.0 of GraphStream, the team is pleased to offer a video that provides an overview of some features of this new release :

1. Generators, it is an overview of some generators that can be found in GraphStream. Generators allow to produce a graph (static or dynamic).
2. Algorithms, some examples of algorithms : A*, Kruskal spanning tree, Betweenness Centrality.
3. Stylesheet, a demonstration of some style properties. GraphStream uses a CSS syntax to define thee graph style.
4. New UI, the new release comes with an alternative viewer in the package gs-ui, written in Scala. All the video is made with this new viewer but this part focuses on the ability to move the view center and to change the zoom from the program.
5. Geographic Information System : GraphStream contains a new experimental packages, called gs-geography, that allows to produce a graph from a shape file. This part displays the graph of the city of Le Havre (France) and runs the algorithm RandomWalk on it to simulate traffic.

The video is available on Youtube or by flashing the following qrcode with your smartphone :

You can also download the video from the GraphStream website (xvid codec):

• 720p (130Mo)
• 360p ( 70Mo)
• 240p ( 34Mo)

  This video is open-source and code used to create it will be provide on the GraphStream website soon.

The GraphStream team is happy to announce the release of the first stable version of GraphStream. We hope it will fulfill your needs and that you will enjoy the new features that come with it. Please do not hesitate to provide us with your comments through the mailing list and to submit bugs on the issue tracking system at http://tracker.graphstream-project.org/.

http://graphstream-project.org/download/

The GraphStream team

GraphStream changes its issues tracker to the one of GitHub. Feel free to submit issues on the github page of GraphStream packages. https://github.com/graphstream/gs-core/issues

This is a first attempt for a beta version of the new GraphStream website.