LightGraphs v1.0.0

LightGraphs grows up.

Changes from 0.14:

• parallel functions moved into a new LightGraphs.Parallel module
• efficiency improvements to various algorithms
• graph isomorphism algorithms in LightGraphs.Experimental
• improvements to documentation
• fixed an obscure bug in dijkstra_shortest_paths

LG 1.0.0 is tested to work with Julia 1.0.

Thank you to all contributors - we couldn't have reached this milestone without you.

LightGraphs v0.14.0

• dependence on Arpack.jl now that eigs has moved from stdlib to third-party package (note - this currently breaks on source builds on OSX and other platforms with compilers > GCC7; see JuliaLinearAlgebra/Arpack.jl#5)

• parallel versions of Floyd-Warshall (#907) and pagerank (#922)

• change to has_edge: has_edge(g, i, j) is the new API contract; has_edge(g, e) is reserved to graph creators to support strict edge equality testing.

• new LightGraphs.Experimental module that will allow quick development and iteration not subject to semver restrictions.

LightGraphs v0.13.1

In this update:

• more 0.7 deprecation fixes (#865, #867, #891, #894, #895)

• optional sorting algorithm for gdistances (#868)

• speed /efficiency improvements to

  • transitiveclosure! (#870)
  • Floyd-Warshall (#873)
  • Kruskal (#896)

• minor bug fix for fruchtgraph (#878)

• added

  • transitivereduction (#877)
  • constructors to create graphs from edge vectors or iterators (#880)

• fixes bug in savegraph method overloading (#901)

LightGraphs v0.13.0

This version of LightGraphs is intended to work exclusively with Julia 0.7-dev and later.

In this release, all LightGraphs-related deprecation warnings have been eliminated (as of date of release). As new Julia deprecations are added prior to Julia 0.7-release, we will fix them in the 0.13 series.

Old deprecations (such as in_edges) have been removed. These functions, if still in use, will now throw errors.

We will tag a new version of LightGraphs once the dependent packages have resolved their own Julia 0.7 deprecation warnings.

LightGraphs v0.12.0

In this release:

• inneighbors / outneighbors replace in_neighbors and out_neighbors (#830)
• flow algorithms moved to LightGraphsFlows (#815)
• expected_degree_graph (#832)
• random_tournament_digraph (#811)
• graph coloring (#844)
• clique_percolation (#826)
• various performance enhancements
• various documentation fixes

This will be the last release to support Julia v0.6.

LightGraphs v0.11.1

Significant changes:

• add_vertices! now returns the number of vertices added

Minor changes:

• mincut functions are no longer visitor-based.
• documentation / comment fixes
• linting
• CITING.md
• updates to gzip compression libs
• improvements to BFS (first of many)

LightGraphs v0.11.0

This one goes to 11.

Major changes:
AbstractGraph is now parameterized with the type of the vertex: AbstractGraph{T}. This allows us
to reduce our reliance on eltype() and makes it possible to do some interesting dispatching on the
vertex type.

We are updating all other graph types (SimpleWeightedGraphs, MetaGraphs, and the new StaticGraphs) to accommodate this change. It should only be a breaking change for people who have created their own graph types.

LightGraphs v0.10.5

In this release:

• minor behind-the-scenes updates to edge iteration
• minor performance improvements to gdistances

LightGraphs v0.10.4

In this release:

• performance improvements
• new in operator for edges (e in g)
• simplified edge iterator
• non-visitor-based maxadjvisit
• fixed an edge case bug in adjacency_matrix

LightGraphs v0.10.3

• changes to PriorityQueue
• adjacency_matrix and laplacian_matrix indices now correspond to graph's eltype
• changed Julia 0.6-pre requirement to 0.6