GDS 2.27.0

Neo4j Graph Data Science Plugin changelog 2.27.0

Breaking changes

New features

Bug fixes

• Fix a bug where Leiden algorithm would throw an error when operating on a graph where no swaps would be done in first iteration.
• Fixed a validation bug, where gds.graph.generate would be allow for invalid averageDegree + nodeCount combinations.

Improvements

• The following procedures stop faster when a transaction terminates:

  • gds.bridges.*
  • gds.degree.*
  • gds.articulationPoints.*
  • gds.scaleProperties.*
  • gds.kcore.*
  • gds.sllpa.*
  • gds.prizeSteinerTree.*
  • gds.bellmanFord.*
  • gds.modularity.*
  • gds.hits.*
  • gds.allShortestPaths.delta.*

• Minor improvements in allocated memory by gds.nodeSimilarity.* under certain situations.

• Some unnecessary computations during similarity distribution computations are removed for:

  • gds.knn.stats
  • gds.knn.filtered.stats
  • gds.nodeSimilarity.stats
  • gds.nodeSimilarity.filtered.stats

• Performance improvements when running Yen's shortest path algorithm on undirected or inverse-indexed graphs

Other changes