Releases: neo4j-contrib/neo4j-graph-algorithms
3.5.3.0
What happened in this release?
-
Batching of writes for similarity algorithms
-
Link prediction functions - Adamic Adar, Common Neighbors, Resource Allocation
-
Community Detection algorithms streaming output unified
3.4.12.2
What happened in this release?
-
Batching of writes for similarity algorithms
-
Link prediction functions - Adamic Adar, Common Neighbors, Resource Allocation
-
Community Detection algorithms streaming output unified
3.5.2.0
What happened in this release?
-
Bug fix for Pearson similarity
-
Write version of Louvain now returns modularities
3.4.12.1
What happened in this release?
-
Bug fix for Pearson similarity
-
Write version of Louvain now returns modularities
3.5.1.0
What happened in this release?
-
Added Pearson similarity
-
Added Article Rank
-
Added support for Cypher projections with similarity algorithms
-
Added support for pre-defined communities for Louvain algorithm
-
Performance optimizations for Louvain algorithm
-
Fixed issue loading self loops
3.4.12.0
What happened in this release?
-
Added Pearson similarity
-
Added Article Rank
-
Added support for Cypher projections with similarity algorithms
-
Added support for pre-defined communities for Louvain algorithm
-
Performance optimizations for Louvain algorithm
-
Fixed issue loading self loops
3.5.0.1
What happened in this release?
-
Added support for weighted PageRank
-
Added Overlap similarity
-
Fixed regression with Louvain introduced in 3.4.7.0
-
Fixed memory issue with Yen's shortest path
3.4.8.0
What happened in this release?
-
Added support for weighted PageRank
-
Added Overlap similarity
-
Fixed regression with Louvain introduced in 3.4.7.0
-
Fixed memory issue with Yen's shortest path
3.5.0.0
With the release of the first beta of Neo4j 3.5 we now have our first of Graph Algorithms to go with that.
What happened in this release?
-
Added similarity functions and procedures - Jaccard, Cosine, Euclidean
-
Added streaming variant of Yen's k-Shortest path
-
Added 2nd stage of Louvain
-
Added Balanced Triads
-
Shortest path algorithms all now default to undirected graph. This can be configured by passing in
direction: "outgoing/incoming/both"
3.4.7.0
What happened in this release?
-
Added similarity functions and procedures - Jaccard, Cosine, Euclidean
-
Added streaming variant of Yen's k-Shortest path
-
Added 2nd stage of Louvain
-
Added Balanced Triads
-
Shortest path algorithms all now default to undirected graph. This can be configured by passing in
direction: "outgoing/incoming/both"