[igraph-announce] igraph 0.5.4 released

[Gábor Csárdi]

Dear All,

I've just uploaded the files of the 0.5.4 version to the homepage. You
might have noticed that the R package for 0.5.4 has been available for
a while from CRAN, it is high time to make the release official. This
is a bug-fix release, there are not too many new features. A big
thanks to everybody who reported bugs and/or sent suggestions.
I believe that the packages for the Python interface, and
Debian/Ubuntu packages are coming soon as well.

Check out the igraph homepage at http://igraph.sf.net for more information.

Here is a complete list of changes:

New in the R interface
----------------------
- A simple layout generator for star graphs (layout.star).
- All functions that have vertex id input parameters, handle
  character vectors containing vertex names now.
- Walktrap community detection calculates membership by default now.
- The spinglass community detection now reports the generalized
  modularity value.

Bugs corrected in the R interface
---------------------------------
- Fixed a missing id problem when writing out Pajek files and using
  complex vertex id attributes.
- Fixed bugs in writing NCOL and LGL files, when edge weights are
  present. The edge weights were shuffled.
- The loop.angle graphical parameter is interpreted in radian now (#517685).
- Fixed a bug when the edge.curved graphical parameter was a vector and
  the graph had loop edges (#517697).
- Plotting: fixed a bug with 'square' vertices and exactly vertical
  edges (#517635).
- Fixed a bug in the conversion from graphNEL format, when all nodes
  have the same degree.
- Speeded up smart indexing, when many object are in the workspace
  (#528963).
- Plotting: fixed loop edge labels when plotmath expressions are used
  (#527895).
- In spinglass community detection, corrected weighted modularity
  calculation (#539413).
- Fixed memory leaks and segmentation fault in average nearest
  neighbor degree calculation (#541705).
- Fixed a bug in the label propagation community finder.
- Fixed another bug in the label propagation community finder (#570902).
- Fixed a bug in the attribute handler, this speeds up the handing of
  attributes.
- PageRank and eigenvector centrality calculations work now for empty
  graphs (#575032).
- tkplot() can handle different label colors now (partially fixes #572559).
- Fixed a subcomponent() bug when vertex id is NA (#583239).
- hub.score() and authority.score() work for graphs with less than
  three vertices.
- Updates to make igraph work in Windows64.
- Fixed a bug for spinglass community detection of a single vertex.
- graph.data.frame() replaces NA's with "NA" only in the first two
  columns.
- Eliminated a warning when arrow.mode is specified and the same
  for all edges (#591835).
- Fixed a bug in DLA layout merge.
- Fixed motif estimation bug, when cutting the search tree (#362519).
- Fixed a bug in Laplacian calculation when the graph had multiple
  edges (#613161).

New in the Python interface
---------------------------
- A simple layout generator for star graphs (Graph.layout_star)
- VertexClustering objects can now be plotted directly using plot()
- Added spinglass community detection (Graph.community_spinglass)
- Added support for the GraphDB format (Graph.Read_GraphDB)
- Graph.simplify() now lets you define how attributes are merged during
  the process
- You can now use save() to pickle graphs in StringIO objects

Bugs corrected in the Python interface
--------------------------------------
- Unicode strings are now automatically converted to UTF-8 when saving
  GraphML files
- Fixed a bug where attributes were lost for imported empty graphs
  (#571440)
- Fixed an issue with Python's built-in table of interned strings
- Fixed a bug when some exceptions were masked by InternalErrors
- Fixed a bug when reading pickled graphs (#579295)
- grid_width argument is now interpreted correctly in Matrix.__plot__
- Fixed bugs when writing out NCOL and LGL files with edge weights,
  the weights were shuffled.
- In spinglass community detection, corrected weighted modularity
  calculation (#539413).
- The spinglass community detection now reports the generalized
  modularity value.
- Fixed memory leaks and segmentation fault in average nearest
  neighbor degree calculation (#541705).
- Fixed a bug in the label propagation community finder.
- Fixed another bug in the label propagation community finder (#570902).
- PageRank and eigenvector centrality calculations work now for empty
  graphs (#575032).
- Fixed bug in Graph.subcomponent() when vertex id is None (#583239).
- Graph.hub_score() and Graph.authority_score() work for graphs with
  less than three vertices.
- Fixed motif estimation bug, when cutting the search tree (#362519).
- Fixed a bug in Laplacian calculation when the graph had multiple
  edges (#613161).
- Fixed a problem with the DIMACS reader (#621716)

New in the C layer
------------------
- A simple layout generator for star graphs (igraph_layout_star)
- Added the igraph_decompose_destroy function, to deallocate memory
  allocated by igraph_decompose.
- igraph_path_length_hist now allows NULL for the 'unconnected'
  argument.

Bugs corrected in the C layer
-----------------------------
- Fixed bugs when writing out NCOL and LGL files with edge weights,
  the weights were shuffled.
- Fixed a memory leak in igraph_vs_as_vector.
- Fixed a bug in igraph_degree_sequence_game, simple method. Passing
  NULL as the in-degree sequence did not work. (#527822).
- In spinglass community detection, corrected weighted modularity
  calculation (#539413).
- The spinglass community detection now reports the generalized
  modularity value.
- Fixed memory leaks and segmentation fault in average nearest
  neighbor degree calculation (#541705).
- Fixed a bug in the label propagation community finder.
- Fixed another bug in the label propagation community finder (#570902).
- PageRank and eigenvector centrality calculations work now for empty
  graphs (#5750032).
- Fixed an igraph_subcomponent bug when vertex id is NA (#583239).
- Fixed an igraph_subcomponent bug when the initial result vector was
  not empty.
- igraph_hub_score() and igraph_authority_score() work for graphs with
  less than three vertices.
- Updates to make igraph work in Windows64.
- Fixed a bug in DLA layout merge, RNG_BEGIN() was not called.
- Fixed motif estimation bug, when cutting the search tree (#362519).
- Fixed a bug in Laplacian calculation when the graph had multiple
  edges (#613161).

-- 
Gabor Csardi <address@hidden>     UNIL DGM