C/igraph 0.10.9

C/igraph 0.10.9 is now released. As usual, the source can be obtained from the GitHub releases page. This is a maintenance release bringing multiple fixes, but also new experimental functions for checking whether a graph is biconnected and for generating bipartite graphs from bidegree sequences. Updating is recommended for all users of igraph 0.10. The full list of changes is below.


  • igraph_is_biconnected() checks if a graph is biconnected.
  • igraph_igraph_realize_bipartite_degree_sequence() constructs a bipartite graph that has the given bidegree sequence, optionally ensuring that it is connected (PR #2425 by Lára Margrét Hólmfríðardóttir @larah19).


  • More robust error handling in HRG code.
  • Fixed infinite loop in igraph_hrg_sample_many().
  • igraph_community_fastgreedy() no longer crashes when providing a modularity vector only, but not a merges matrix of membership vector.
  • The graph property cache was not initialized correctly on systems where the size of bool was not 1 byte (#2477).
  • Compatibility with libxml2 version 2.12 (#2442).


  • The macro STR() is deprecated; use the function igraph_strvector_get() instead.


  • Performance: Reduced memory usage and improved initialization performance for igraph_strvector_t.
  • Performance: Improved cache use by igraph_is_bipartite().
  • The documentation is now also generated in Texinfo format.
  • Documentation improvements
1 Like