LightGraphs v1.3.5

Fixes hashing of edges.

LightGraphs v1.3.4

This release contains bugfixes and bumps dependency versions.

LightGraphs v1.3.3

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.

LightGraphs v.1.3.2

Hotfix for bug in betweenness_centrality.

LightGraphs. v1.3.1

Many changes:

• experimental visitor functions for BFS and DFS traversals (#1278)
• performance improvements (#1281)
• new boruvka function (#1261)

bugfixes to adjacency_matrix, incidence_matrix, a_star, clustering,
documentation fixes / enhancements
testing enhancements
infrastructure (travis / CI / build process) improvements

LightGraphs v1.3.0

LightGraphs v1.3.0.

Fixed:

• infinite cycle traversal in floyd-warshall (#1075)
• speed improvements in transitive closure (#1078)
• misc bugfixes and documentation fixes
• performance improvements to Tarjan (#1182)
• performance improvements to laplacian_matrix (#1191)
• performance improvements to Bellman-Ford shortest path algorithm (#1193)
• nested testsets (still in progress)
• performance improvements to edge iterators (#1202)
• performance improvements to A* shortest path algorithm (#1231)

New:

• karate graph generator (#1045)
• complete_multipartite_graph() and turan_graph() (#1031)
• ladder graphs (#1044)
• rem_vertices! (#1047)
• multiple documentation enhancements
• dominating set (#1039)
• maximum spanning tree (#1081)
• barbell and lollipop graph generators (#1084)
• bridges() (#1105)
• D'Esopo-Pape shortest path algorithm (#1160)
• Kosaraju's algorithm for strongly connected components (#1173)
• Shortest Path Faster algorithm (#1189)
• new shortest paths functions in Experimental/ShortestPaths (#1242)

Changed:

• modularity now considers directed/weighted graphs (#1066, #1068)
• iterative articulation for large graphs (#1111)

LightGraphs v1.2.0

In this release:

• native 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)
• performance improvements to shortest paths (#1012, #1013) and parallel gdistances (#1027)
  -many documentation updates!!
• new Vertex Cover (#949) and Independent Set (#1026)
• new Dorogovtsev Mendes random graph generator (#1032)

LightGraphs v1.1.0

In this release:

• no more Arpack! We're using ArnoldiMethod.jl to provide Julia-native versions of eigs. (#1008)
• LightGraphs now passes tests on 32-bit systems across the board (#999)
• Karger Min Cut functionality (#988)
• bugfixes and a rename of simplecycles_hawick_james (#1007, #1005)
• Parallel BFS! (#943)
• Short cycle detection (#1006)
• Generate-reduce functions (#960)
• multithreaded centrality measures! (#987)
• doc fixes (#1003)

LightGraphs v1.0.2

• Bugfix for edge iteration (#1002)
• Improved documentation (#1001)

LightGraphs v1.0.1

Bugfixes:

• kruskal_mst (#984)
• SimpleGraph(g::SimpleGraph) constructor (#998)
• reverse (#994)

Documentation upgrades (#995)

Experimental:

• Isomorphism refactoring (#981)

Enhancements:

• using Base.OneTo for vertices (#992)