NEWS

About igraph releases and other things

June 24, 2015

Release Notes

This is a new major release, with a lot of UI changes. We tried to make it easier to use, with short and easy to remember, consistent function names. Unfortunately this also means that many functions have new names now, but don't worry, all the old names still work.

Apart from the new names, the biggest change in this release is that most functions that used to return numeric vertex or edge ids, return vertex/edge sequences now. This requires some time to get used to and if you want the numeric ids instead, just use the as.vector() function on the vertex/edge sequences.

We will update the documentation on this site, once the package is on CRAN and available for all architectures.

More →


January 16, 2015

A couple of days ago we changed how we use GitHub for igraph development. Our goal is to make igraph development more accessible, and our build process simpler. Instead of using a common repository for everything, we now use separate repos for the igraph C library, the R package and the Python extension. The igraph.org website was already in a separate repository, and we will also break up the R package, by putting loosely coupled parts in their own packages and repositories.

Main igraph repositories now:


April 21, 2014

Release Notes

Some bug fixes, to make sure that the code included in 'Statistical Analysis of Network Data with R' works. See https://github.com/kolaczyk/sand

Detailed changes:

  • Graph drawing: fix labels of curved edges, issue #181.
  • Graph drawing: allow fixing edge labels at given positions, issue #181.
  • Drop the 'type' vertex attribute after bipartite projection, the projections are not bipartite any more, issue #255.
  • Print logical attributes in header properly (i.e. encoded by l, not x, which is for complex attributes. Issue #578.
  • Add a constructor for communities objects, see create.communities(). Issue #547.
  • Better error handling in the GraphML parser.
  • GraphML reader is a bit more lenient now; makes it possible to read GraphML files saved from yWorks apps.
  • Fixed a bug in constaint(), issue #580.
  • Bipartite projection now detects invalid edges instead of giving a cryptic error, issue #543.
  • Fixed the simplify argument of graph.formula(), which was broken, issue #586.
  • The function crossing() adds better names to the result, fixes issue #587.
  • The sir() function gives an error if the input graph is not simple, fixes issue #582.
  • Calling igraph functions from igraph callbacks is not allowed now, fixes issue #571.

April 21, 2014

Release Notes

Some bug fixes, to make sure that the code included in 'Statistical Analysis of Network Data with R' works. See http://github.com/kolaczyk/sand

Detailed changes:

  • Better error handling in the GraphML parser.
  • GraphML reader is a bit more lenient now; makes it possible to read GraphML files saved from yWorks apps.
  • Fixed a bug in igraph_constaint(), issue #580.
  • Bipartite projection now detects invalid edges instead of giving a cryptic error, issue #543.
  • Bipartite projection now detects invalid edges instead of giving a cryptic error, issue #543.

February 4, 2014

Release Notes

There are a bunch of new features in the library itself, and other important changes in the life of the project. Thanks everyone for sending code and reporting bugs!

igraph @ github

igraph's development has moved from Launchpad to github. This has actually happened several month ago, but never announced officially. The place for reporting bugs is at https://github.com/igraph/igraph/issues.

New homepage

igraph's homepage is now hosted at http://igraph.org, and it is brand new. We wanted to make it easier to use and modern.

More →


February 4, 2014

Release Notes

There are a bunch of new features in the library itself, and other important changes in the life of the project. Thanks everyone for sending code and reporting bugs!

igraph @ github

igraph's development has moved from Launchpad to github. This has actually happened several month ago, but never announced officially. The place for reporting bugs is at https://github.com/igraph/igraph/issues.

New homepage

igraph's homepage is now hosted at http://igraph.org, and it is brand new. We wanted to make it easier to use and modern.

More →


February 4, 2014

Release Notes

There are a bunch of new features in the library itself, and other important changes in the life of the project. Thanks everyone for sending code and reporting bugs!

igraph @ github

igraph's development has moved from Launchpad to github. This has actually happened several month ago, but never announced officially. The place for reporting bugs is at https://github.com/igraph/igraph/issues.

New homepage

The igraph library's homepage is now hosted at http://igraph.org/c, and it is brand new. We wanted to make it easier to use and better to look at.

More →


February 24, 2013

The version number is not a mistake, we jump to 0.6.5 from 0.6, for technical reasons.

Release Notes

igraph 0.6.5 is a minor release that contains only few big changes, and fixes a number of very annoying bugs.

See at the end for the complete list of changes. First let's see the most important new features and changes.

More →


February 24, 2013

The version number is not a mistake, we jump to 0.6.5 from 0.6, for technical reasons.

Release Notes

igraph 0.6.5 is a minor release that contains only few big changes, and fixes a number of very annoying bugs.

See at the end for the complete list of changes. First let's see the most important new features and changes.

More →


February 24, 2013

The version number is not a mistake, we jump to 0.6.5 from 0.6, for technical reasons.

Release Notes

igraph 0.6.5 is a minor release that contains only few big changes, and fixes a number of very annoying bugs.

See at the end for the complete list of changes. First let's see the most important new features and changes.

More →


June 11, 2012

Release Notes

igraph 0.6 is a major new release of igraph. It contains many new features and major changes, a lot of bug fixes and improvements. As always, we are grateful to the people who sent comments, bug reports, questions, and specially to people who contributed code.

See below a list of major changes, with links to the relevant sections of the documentation. New features in R all listed here.

See at the end for a (more) complete list of changes.

More →


June 11, 2012

Release Notes

igraph 0.6 is a major new release of igraph. It contains many new features and major changes, a lot of bug fixes and improvements. As always, we are grateful to the people who sent comments, bug reports, questions, and specially to people who contributed code.

See below a list of major changes, with links to the relevant sections of the documentation. New features are all listed here.

More →


June 11, 2012

Release Notes

igraph 0.6 is a major new release of igraph. It contains many new features and major changes, a lot of bug fixes and improvements. As always, we are grateful to the people who sent comments, bug reports, questions, and specially to people who contributed code.

See below a list of major changes, with links to the relevant sections of the documentation. New features in R, Python, and C are all listed here.

See at the end for a (more) complete list of changes.

More →


November 22, 2009

Bugs corrected in the R interface

  • Some small changes to make R CMD check clean
  • Fixed a bug in graph.incidence, the directed and mode arguments were not handled correctly
  • Betweenness and edge betweenness functions work for graphs with many shortest paths now (up to the limit of long long int)
  • When compiling the package, the configure script fails if there is no C compiler available
  • igraph.from.graphNEL creates the right number of loop edges now
  • Fixed a bug in bipartite.projection() that caused occasional crashes on some systems

November 22, 2009

New in the Python interface

  • Added support for weighted diameter
  • get_eid() considers edge directions by default from now on
  • Fixed a memory leak in the attribute handler
  • NaN and inf are treated correctly now

More →


November 22, 2009

Bugs corrected

  • Betweenness and edge betweenness functions work for graphs with many shortest paths now (up to the limit of long long int)
  • The configure script fails if there is no C compiler available
  • Fixed a bug in igraph_community_spinglass, when csize was a NULL pointer, but membership was not
  • Fixed a bug in igraph_bipartite_projection that caused occasional crashes on some systems

April 10, 2009

Release Notes

This is another bug fix release, with a couple of new features. Here are the important ones. See at the end for the complete list of changes.

Bipartite graphs

Bipartite graphs have two kinds of vertices and edges are only allowed to connect opposite kinds. Think of the Hollywood movie graph with actors and movies. igraph 0.5.2 now contains some functions to deal with these kind of networks.

More →


April 10, 2009

Release Notes

This is another bug fix release, with a couple of new features. Here are the important ones. See at the end for the complete list of changes.

Bipartite graphs

Bipartite graphs have two kinds of vertices and edges are only allowed to connect opposite kinds. Think of the Hollywood movie graph with actors and movies. igraph 0.5.2 now contains some functions to deal with these kind of networks.

More →


April 10, 2009

Release Notes

This is another bug fix release, with a couple of new features. Here are the important ones. See at the end for the complete list of changes.

Bipartite graphs

Bipartite graphs have two kinds of vertices and edges are only allowed to connect opposite kinds. Think of the Hollywood movie graph with actors and movies. igraph 0.5.2 now contains some functions to deal with these kind of networks.

More →


July 14, 2008

igraph 0.5.1 Release Notes

igraph 0.5.1 is a bugfix release, but it actually contains many important new things as well. Here is a brief summary about each of them. See below for the complete list of changes.

More →


July 14, 2008

igraph 0.5.1 Release Notes

igraph 0.5.1 is a bugfix release, but it actually contains many important new things as well. Here is a brief summary about each of them. See below for the complete list of changes.

More →


July 14, 2008

igraph 0.5.1 Release Notes

igraph 0.5.1 is a bugfix release, but it actually contains many important new things as well. Here is a brief summary about each of them. See below for the complete list of changes.

More →


February 14, 2008

Release notes

There are a lot of improvements and corrections in this version. We would like to thank all the people who sent comments, bug reports, patches, or just questions. Without their contribution igraph would be definitely much less and worse than it is now. Please keep sending your comments and ideas!

Here is a list of major changes, with links to the relevant sections of the documentation. See below for the complete list of changes.

More →


February 14, 2008

Release notes

There are a lot of improvements and corrections in this version. We would like to thank all the people who sent comments, bug reports, patches, or just questions. Without their contribution igraph would be definitely much less and worse than it is now. Please keep sending your comments and ideas!

Here is a list of major changes, with links to the relevant sections of the documentation. See below for the complete list of changes.

More →


February 14, 2008

Release notes

There are a lot of improvements and corrections in this version. We would like to thank all the people who sent comments, bug reports, patches, or just questions. Without their contribution igraph would be definitely much less and worse than it is now. Please keep sending your comments and ideas!

Here is a list of major changes, with links to the relevant sections of the documentation. See below for the complete list of changes.

More →


January 1, 2008

New:

  • Cohesive block finding in the R interface, thanks to Peter McMahan for contributing his code. See James Moody and Douglas R. White, 2003, in Structural Cohesion and Embeddedness: A Hierarchical Conception of Social Groups American Sociological Review 68(1):1-25
  • Biconnected components and articulation points.
  • R interface: better printing of attributes.
  • R interface: graph attributes can be used via $.

Bug fixed:

  • Erdos-Renyi random graph generators rewritten.

January 1, 2008

New:

  • Biconnected components and articulation points.

Bug fixed:

  • Erdos-Renyi random graph generators rewritten.

January 1, 2008

New:

  • Biconnected components and articulation points.

New in the C library:

  • igraph_vector_bool_t data type.

Bug fixed:

  • Erdos-Renyi random graph generators rewritten.

October 3, 2007

This release should work seemlessly with the new R 2.6.0 version. Some other bugs were also fixed:

  • A bug was fixed in the Erdos-Renyi graph generator, which sometimes added an extra vertex.
  • MSVC compilation issues were fixed.
  • MinGW compilation fixes.

October 3, 2007

Some bugs were fixed:

  • A bug was fixed in the Erdos-Renyi graph generator, which sometimes added an extra vertex.
  • MSVC compilation issues were fixed.
  • MinGW compilation fixes.

October 3, 2007

Some bugs were fixed:

  • A bug was fixed in the Erdos-Renyi graph generator, which sometimes added an extra vertex.
  • MSVC compilation issues were fixed.
  • MinGW compilation fixes.

August 13, 2007

The next one in the sequence of bugfix releases. Thanks to many people sending bug reports. Here are the changes:

  • Some memory leaks removed when using attributes from R or Python.
  • GraphML parser: entities and character data in multiple chunks are now handled correctly.
  • A bug corrected in edge betweenness community structure detection, it failed if called many times from the same program/session.
  • Bug corrected in 'adjacent edges' edge iterator.
  • Edge betweeness community structure: handle unconnected graphs properly.
  • Fixed bug related to fast greedy community detection in unconnected graphs.
  • Use a different kind of parser (Push) for reading GraphML files. This is almost invisible for users but fixed a nondeterministic bug when reading in GraphML files.
  • R interface: plot now handles properly if called with a vector as the edge.width argument for directed graphs.
  • R interface: bug (typo) corrected for walktrap.community and weighted graphs.
  • Test suite should run correctly on Cygwin now.

August 13, 2007

The next one in the sequence of bugfix releases. Thanks to many people sending bug reports. Here are the changes:

  • Some memory leaks removed when using attributes.
  • GraphML parser: entities and character data in multiple chunks are now handled correctly.
  • A bug corrected in edge betweenness community structure detection, it failed if called many times from the same program/session.
  • Bug corrected in 'adjacent edges' edge iterator.
  • Python interface: edge and vertex attribute deletion bug corrected.
  • Edge betweeness community structure: handle unconnected graphs properly.
  • Fixed bug related to fast greedy community detection in unconnected graphs.
  • Use a different kind of parser (Push) for reading GraphML files. This is almost invisible for users but fixed a nondeterministic bug when reading in GraphML files.
  • Test suite should run correctly on Cygwin now.

August 13, 2007

The next one in the sequence of bugfix releases. Thanks to many people sending bug reports. Here are the changes:

  • GraphML parser: entities and character data in multiple chunks are now handled correctly.
  • A bug corrected in edge betweenness community structure detection, it failed if called many times from the same program/session.
  • Bug corrected in 'adjacent edges' edge iterator.
  • Edge betweeness community structure: handle unconnected graphs properly.
  • Fixed bug related to fast greedy community detection in unconnected graphs.
  • Use a different kind of parser (Push) for reading GraphML files. This is almost invisible for users but fixed a nondeterministic bug when reading in GraphML files.
  • Test suite should run correctly on Cygwin now.

June 7, 2007

This is another bugfix release, as there was a serious bug in the R package of the previous version: it could not read and write graphs to files in any format under MS Windows.

Some other bits added:

  • circular Reingold-Tilford layout generator for trees
  • corrected a bug, Pajek files are written properly under MS Windows now.
  • arrow.size graphical edge parameter added in the R interface.

June 7, 2007

This is another bugfix release. Some other bits added:

  • circular Reingold-Tilford layout generator for trees
  • corrected a bug, Pajek files are written properly under MS Windows now.

June 7, 2007

This is another bugfix release.

Some other bits added:

  • circular Reingold-Tilford layout generator for trees
  • corrected a bug, Pajek files are written properly under MS Windows now.

May 23, 2007

This is a minor release, it corrects a number of bugs, mostly in the R package.


May 23, 2007

This is a minor release, it corrects a number of bugs.


May 23, 2007

This is a minor release, it corrects a number of bugs.


May 21, 2007

The major new additions in this release is a bunch of community detection algorithms and support for the GML file format. Here is the complete list of changes:

More →


May 21, 2007

The major new additions in this release is a bunch of community detection algorithms and support for the GML file format. Here is the complete list of changes:

More →


May 21, 2007

The major new additions in this release is a bunch of community detection algorithms and support for the GML file format. Here is the complete list of changes:

More →


New in the R interface

  • connect.neighborhood()
  • watts.strogatz.game() and rewire.edges()
  • K-core decomposition: graph.coreness()
  • added the innei and outnei shorthands for vertex sequence indexing see help(iterators)
  • Clique and independent vertex set related functions: cliques, largest.cliques, maximal.cliques, clique.number, independent.vertex.sets, largest.independent.vertex.sets, maximal.independent.vertex.sets, independence.number
  • The GraphML file format now supports graph attributes
  • edge.lty argument added to plot.igraph and tkplot
  • Transitivity calculation speeded up
  • Correct transitivity calculation for multigraphs (ie. non-simple graphs)
  • alpha.centrality added(), calculates Bonacich alpha centrality, see docs.

More →


New in the C library

  • igraph_connect_neighborhood(), nomen est omen
  • igraph_watts_strogatz_game() and igraph_rewire_edges()
  • K-core decomposition: igraph_coreness()
  • Clique and independent vertex set related functions: igraph_cliques(), igraph_independent_vertex_sets(), igraph_maximal_cliques(), igraph_maximal_independent_vertex_sets(), igraph_independence_number(), `igraphcliquenumber(), Some of these function were ported from the very_nauty library of Keith Briggs, thanks Keith!
  • The GraphML file format now supports graph attributes
  • Transitivity calculation speeded up
  • Correct transitivity calculation for multigraphs (ie. non-simple graphs)

More →


New in the C library

  • igraph_connect_neighborhood(), nomen est omen
  • igraph_watts_strogatz_game() and igraph_rewire_edges()
  • K-core decomposition: igraph_coreness()
  • Clique and independent vertex set related functions: igraph_cliques(), igraph_independent_vertex_sets(), igraph_maximal_cliques(), igraph_maximal_independent_vertex_sets(), igraph_independence_number(), `igraphcliquenumber(), Some of these function were ported from the very_nauty library of Keith Briggs, thanks Keith!
  • The GraphML file format now supports graph attributes
  • Transitivity calculation speeded up
  • Correct transitivity calculation for multigraphs (ie. non-simple graphs)

More →


January 8, 2007

The documentation of the Python interface is available. See section 'documentation' in the menu.


December 19, 2006

This is a new major release, it contains many new things: geometric random graphs, creating a graph with attributes from a data frame in R, local transitivity, etc.

More →


December 19, 2006

This is a new major release, it contains many new things: geometric random graphs, local transitivity, etc.

More →


December 19, 2006

This is a new major release, it contains many new things: geometric random graphs, local transitivity, etc.

More →


August 23, 2006

This is a bug-fix release. Bugs fixed:

  • igraph_reciprocity (reciprocity in R) corrected to avoid segfaults
  • some docs updates
  • various R package updated to make it conform to the CRAN rules

August 23, 2006

This is a bug-fix release. Bugs fixed:

  • igraph_reciprocity corrected to avoid segfaults
  • some docs updates

August 23, 2006

This is a bug-fix release. Bugs fixed:

  • igraph_reciprocity corrected to avoid segfaults
  • some docs updates

August 18, 2006

I've set up two igraph mailing lists: igraph-help for general igraph questions and discussion and igraph-anonunce for announcements. See http://lists.nongnu.org/mailman/listinfo/igraph-help and http://lists.nongnu.org/mailman/listinfo/igraph-announce for subscription information, archives, etc.


August 18, 2006

Release time at last! There are many new things in igraph 0.2, the most important ones:

  • reading writing Pajek and GraphML formats with attributes (not all Pajek and GraphML files are supported, see documentation for details)
  • iterators totally rewritten, it is much faster and cleaner now
  • the RANDEDU fast motif search algorithm is implemented
  • many new graph generators, both games and regular graphs
  • many new structural properties: transitivity, reciprocity, etc.
  • graph operators: union, intersection, difference, structural holes, etc.
  • conversion between directed and undirected graphs
  • new layout algorithms for trees and large graphs, 3D layouts

and many more.

New things in the R package:

  • support for CTRL+C
  • new functions: Graph Laplacian, Burt's constraint, etc.
  • vertex/edge sequences totally rewritten, smart indexing (see manual)
  • new R manual and tutorial: 'Network Analysis with igraph', still under development but useful
  • very basic 3D plotting using OpenGL

Although this release was somewhat tested on Linux, MS Windows, Mac OSX, Solaris 8 and FreeBSD, no heavy testing was done, so it might contain bugs, and we kindly ask you to send bug reports to make igraph better.


August 18, 2006

Release time at last! There are many new things in igraph 0.2, the most important ones:

  • reading writing Pajek and GraphML formats with attributes (not all Pajek and GraphML files are supported, see documentation for details)
  • iterators totally rewritten, it is much faster and cleaner now
  • the RANDEDU fast motif search algorithm is implemented
  • many new graph generators, both games and regular graphs
  • many new structural properties: transitivity, reciprocity, etc.
  • graph operators: union, intersection, difference, structural holes, etc.
  • conversion between directed and undirected graphs
  • new layout algorithms for trees and large graphs, 3D layouts

and many more.

Although this release was somewhat tested on Linux, MS Windows, Mac OSX, Solaris 8 and FreeBSD, no heavy testing was done, so it might contain bugs, and we kindly ask you to send bug reports to make igraph better.


August 18, 2006

Release time at last! There are many new things in igraph 0.2, the most important ones:

  • reading writing Pajek and GraphML formats with attributes (not all Pajek and GraphML files are supported, see documentation for details)
  • iterators totally rewritten, it is much faster and cleaner now
  • the RANDEDU fast motif search algorithm is implemented
  • many new graph generators, both games and regular graphs
  • many new structural properties: transitivity, reciprocity, etc.
  • graph operators: union, intersection, difference, structural holes, etc.
  • conversion between directed and undirected graphs
  • new layout algorithms for trees and large graphs, 3D layouts

and many more.

Although this release was somewhat tested on Linux, MS Windows, Mac OSX, Solaris 8 and FreeBSD, no heavy testing was done, so it might contain bugs, and we kindly ask you to send bug reports to make igraph better.


January 30, 2006

After about a year of development this is the first "official" release of the igraph library. This release should be considered as beta software, but it should be useful in general. Please send your questions and comments.


January 30, 2006

After about a year of development this is the first "official" release of the igraph library. This release should be considered as beta software, but it should be useful in general. Please send your questions and comments.


January 30, 2006

After about a year of development this is the first "official" release of the igraph library. This release should be considered as beta software, but it should be useful in general. Please send your questions and comments.