Neo4j Graph Algorithms Versions Save

Efficient Graph Algorithms for Neo4j

3.5.4.0

5 years ago

What happened in this release?

  • Fixed PageRank overflow bug when working with nodes with very large degrees
  • Adapted concurrency in community edition to desktop and entry level server capabilities.

3.4.12.7

5 years ago

What happened in this release?

  • Fixed PageRank overflow bug when working with nodes with very large degrees
  • Adapted concurrency in community edition to desktop and entry level server capabilities.

3.5.3.4

5 years ago

What happened in this release?

  • Bug fix for Degree Centrality
  • Added InfoMap, BFS, DFS
  • Renamed algo.getNodeById to algo.asNode
  • Added algo.asPath
  • Support for huge graphs for LPA
  • UnionFind deadlock bug fix
  • Fixed bug with default weight property on shortest path procedure

3.4.12.6

5 years ago

What happened in this release?

  • Bug fix for Degree Centrality
  • Added InfoMap, BFS, DFS
  • Renamed algo.getNodeById to algo.asNode
  • Added algo.asPath
  • Support for huge graphs for LPA
  • UnionFind deadlock bug fix
  • Fixed bug with default weight property on shortest path procedure

3.5.3.3

5 years ago

What happened in this release?

  • Added Eigenvector Centrality
  • Refactored Strongly Connected Components, Connected Components, Label Propagation to use writeProperty instead of partitionProperty. Old parameter still works for backwards compatability
  • Refactored algo.lpa to match signatures of other write algorithms. Old signature still works for backwards compatability

3.4.12.5

5 years ago

What happened in this release?

  • Added Eigenvector Centrality
  • Refactored Strongly Connected Components, Connected Components, Label Propagation to use writeProperty instead of partitionProperty. Old parameter still works for backwards compatability
  • Refactored algo.lpa to match signatures of other write algorithms. Old signature still works for backwards compatability

3.5.3.2

5 years ago

What happened in this release?

  • Louvain - support for Random Neighbor Community Selection
  • Added Degree Centrality
  • Similarity Algorithms now support optional sourceIds and targetIds
  • Added duplicate neighbors strategy for Cypher loading - can now choose to pick first weight, maximum weight, minimum weight, or sum relationship weights
  • Bug fix for k shortest path max depth - thanks to @frant-hartm
  • algo.list() now returns functions as well as procedures

3.4.12.4

5 years ago

What happened in this release?

  • Louvain - support for Random Neighbor Community Selection
  • Added Degree Centrality
  • Similarity Algorithms now support optional sourceIds and targetIds
  • Added duplicate neighbors strategy for Cypher loading - can now choose to pick first weight, maximum weight, minimum weight, or sum relationship weights
  • Bug fix for k shortest path max depth - thanks to @frant-hartm
  • algo.list() now returns functions as well as procedures

3.5.3.1

5 years ago

What happened in this release?

  • Link prediction functions - Total Neighbors, Same Community, Preferential Attachment

  • Bug fix for neighbor computation

3.4.12.3

5 years ago

What happened in this release?

  • Link prediction functions - Total Neighbors, Same Community, Preferential Attachment

  • Bug fix for neighbor computation