igraph 0.10.12

Added

• igraph_transitive_closure() computes the transitive closure of a graph (experimental function).
• igraph_reachability() determines which vertices are reachable from each other in a graph (experimental function).
• igraph_count_reachable() counts how many vertices are reachable from each vertex (experimental function).
• Added a bitset data structure, igraph_bitset_t, and a set of corresponding functions (experimental functionality).

Fixed

• igraph_community_label_propagation() is now interruptible.
• igraph_is_bipartite() would on rare occasions return invalid results when the cache was employed.
• igraph_weighted_adjacency() correctly passes through NaN values with IGRAPH_ADJ_MAX, and correctly recognizes symmetric adjacency matrices containing NaN values with IGRAPH_ADJ_UNDIRECTED.
• igraph_read_graph_gml() can now read GML files that use ids larger than what is representable on 32 bits, provided that igraph was configured with a 64-bit igraph_integer_t size.
• Fixed a performance issue in igraph_read_graph_graphml() with files containing a very large number of entities, such as >.
• igraph_read_graph_pajek() has improved vertex ID validation that better matches that of Pajek's own behavior.

Changed

• igraph_eigenvector_centrality() no longer issues a warning when the input is directed and weighted. When using this function, keep in mind that eigenvector centrality is well-defined only for (strongly) connected graphs, and edges with a zero weights are effectively treated as absent.

Deprecated

• igraph_transitive_closure_dag() is deprecated in favour of igraph_transitive_closure()

Other

• Documentation improvements.
• igraph_strength() and igraph_degree(loops=false) are now faster when calculating values for all vertices (contributed by @gendelpiekel in #2602)