An optimized graphs package for the Julia programming language
Fixes hashing of edges.
This release contains bugfixes and bumps dependency versions.
Hotfix for bug in core_number
.
This is a bug in the correctness of core_number. The old version produced incorrect results when run on directed graphs with bidirectional edges. The reason is that the old code used all_neighbors to determine the set of neighbors to process; the issue is that all_neighbors ensures no duplicates: so if you had an edge from X -> Y and another from Y -> X, the neighbors of X would only include Y one time. This is not what the algorithm specifies.
So we fixed it by explicitly using outneighbors and inneighbors so that bidirectional edges are included. Fortuitously, this also resulted in a speedup as all_neighbors needed to deduplicate; and we explicitly do not want that behavior here.
So - if you’ve been using core_number results with directed graphs anywhere, (including with k_core and the other degeneracy functions), you will probably want to re-run your results with this fix applied.
Hotfix for bug in betweenness_centrality
.
Many changes:
bugfixes to adjacency_matrix, incidence_matrix, a_star, clustering, documentation fixes / enhancements testing enhancements infrastructure (travis / CI / build process) improvements
LightGraphs v1.3.0.
Fixed:
laplacian_matrix
(#1191)New:
complete_multipartite_graph()
and turan_graph()
(#1031)rem_vertices!
(#1047)bridges()
(#1105)Experimental/ShortestPaths
(#1242)Changed:
In this release:
LGFormat()
will no longer save compressed graphs. This allows us to remove the dependency on CodecZlib
(but introduces a new dependence on Inflate
). Saving compressed graphs has been moved to GraphIO
. (#1024)In this release:
eigs
. (#1008)simplecycles_hawick_james
(#1007, #1005)Bugfixes:
kruskal_mst
(#984)SimpleGraph(g::SimpleGraph) constructor
(#998)reverse
(#994)Documentation upgrades (#995)
Experimental:
Enhancements:
Base.OneTo
for vertices
(#992)