About igraph releases and other things
IGraph/M 0.6.0, the Mathematica interface of igraph, is now out! This released is based on the 0.9 series of C/igraph, bringing significant robustness improvements, as well as new features. Some of the highlights are an experimental interactive graph editor, contributed by Kuba Podkalicki, and experimental support for progress reporting. Apple computers based on the ARM architecture (“Apple Silicon”) are now supported.
As always, you can update to the latest version by evaluating the following:
The earliest supported Mathematica version is now 11.0, or 12.2 on the Raspberry Pi.
Please report any issues you may find on GitHub or on our forum.
This version is based on the 0.9 series of C/igraph.
IGHarmonicCentralityCutoffcompute the harmonic centrality and range-limited harmonic centrality.
IGPersonalizedLinkRankcompute the equivalent of PageRank for edges.
IGNeighborhoodClosenesscomputes the range-limited closeness centrality, as well as the number of vertices reachable within the given range.
IGFamousGraphexposes the igraph C library’s built-in graph database.
IGAsymmetricPreferenceGamecreate non-growing random graphs based on vertex types.
IGReingoldTilfordCircularnow support the
IGFruchtermanReingoldnow supports constraining the coordinates of a subset of vertices.
IGPercolationCurvefor efficiently computing the size of the largest component as a function of mean degree while removing edges.
IGShortestPathTreefor computing a shortest path tree rooted in a given vertex.
IGGraphEditoris an experimental interactive graph editor.
IGWeaklyConnectedQnow consider the null graph to be disconnected; this is consistent with other functions such as
IGAveragePathLengthnow has a
"ByComponents"option, controlling the handling of disconnected graphs.
IGClosenessnow computes the normalized closeness, i.e. the inverse of the mean distance to other vertices, by default. Use
Normalized -> Falseto get the previous behaviour.
IGClosenessnow uses the distances only to reachable vertices when computing the closeness. In undirected disconnected graphs, it effectively computes the closeness per component. For isolated vertices (or sinks in directed graphs) it now returns
IGBetweennessCentralizationno longer uses the
Methodoption. The calculations are always fast and precise. The precision has been improved.
IGClosenessEstimatehave been renamed to
IGRelativeNeighborhoodGraphnow assumes the
β -> 2,
β < 2limit instead of
β = 2.
Infinityfor the null graph.
Indeterminatefor the null graph.
IGMaximumCardinalitySearchnow support non-simple graphs.
IGReingoldTilfordCircularuse a new automatic root selection algorithm. The root selection heuristic may change in the future without notice. Specify roots manually for a consistent result.
IGPotentiallyConnectedQno longer supports directed sequences. This feature was flawed in 0.5. It may be re-added in a future version.
IGLayoutKamadaKawai3Dperform more iterations by default, and produce more pleasing layouts.
IGPersonalizedPageRankallows specifying the reset weights as an association from vertex names to values.
IGPersonalizedPageRankwill now warn if the calculation did not converge with the
"Arnoldi"method. This happens only in rare cases.
IGPersonalizedPageRank: the default
"PRPACK"method returned an incorrect result when the graph was not connected and the personalization vector was not uniform.
IGVertexMapwould evaluate the mapped functions twice instead of once.
IGMaximumCardinalitySearchreturned incorrect ranks for graphs whose vertex names differed from their vertex indices.
IGDistanceWeightedno longer fails on edgeless graphs.
IGCallawayTraisGameno longer rejects zeros in the preference matrix.
IGMotifsVertexParticipationwould fail with Mathematica 12.2 or later.