@neo-technology-build-agent neo-technology-build-agent released this Oct 11, 2018 · 21 commits to 3.4 since this release

Assets 3

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

@neo-technology-build-agent neo-technology-build-agent released this Oct 11, 2018 · 2 commits to 3.4 since this release

Assets 3

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

@neo-technology-build-agent neo-technology-build-agent released this Oct 10, 2018 · 21 commits to 3.4 since this release

Assets 3

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"

@mneedham mneedham released this Oct 9, 2018 · 39 commits to 3.4 since this release

Assets 3

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"

@mneedham mneedham released this Jul 23, 2018 · 98 commits to 3.4 since this release

Assets 3

What happened in this release?

  • Bug fixes in Closeness Centrality and Delta Stepping Algorithms

  • Added Random Walk Algorithm. Thanks to Freya Behrens, Sebastian Bischoff, Pius Ladenburger, Julius Rückin, Laurenz Seidel, Fabian Stolp, Michael Vaichenker and Adrian Ziegler of the MetaExp-Project for their work on this. You can learn more about this algorithm in the documentation.

  • Added support for Personalized PageRank. This is the most basic variant so please let us know if it works for you or if you need some other features supported.

  • Yens k-shortest path algorithm now stores weights along with the stored shortest path relationships

  • Bug fix when loading nodes with links to themselves

@mneedham mneedham released this May 15, 2018 · 361 commits to 3.2 since this release

Assets 3

What happened in this release?

  • Documentation has now moved onto neo4j.com. You can find it at neo4j.com/docs/graph-algorithms/3.4/

  • Internal refactoring to support the new 3.4 kernel API

  • Yens k-shortest path added

  • Streaming version of Label Propagation algorithm added.

  • A* algorithm added. Thanks to Sadeep Madurange for working on this one.

@mneedham mneedham released this May 15, 2018 · 361 commits to 3.2 since this release

Assets 3

What happened in this release?

@mneedham mneedham released this May 15, 2018 · 11 commits to 3.2 since this release

Assets 3

What happened in this release?

Assets 3

Thanks a lot to Paul Horn and Martin Knobloch from Avantgarde Labs for their tireless work on the graph algorithms. Thanks also to Tomasz Bratanic for the great documentation work.

New algorithms

More support for large Graphs

In the previous release we added support for large graphs with the graph:huge config parameter.
This release adds huge graph support to the following algorithms:

  • Closeness Centrality
  • Harmonic Centrality
  • Union Find
  • Strongly Connected Components
  • Triangle Counting
  • Louvain

Graph Loading

It can take some time to load large graphs into the algorithm data structures, so you can now pre-load graphs and then later refer to them by name when calling the graph algorithms.
After usage they can be removed from memory to free resources used.

Learn more in the README

Documentation

You can find documentation for the new algorithms and examples of how to apply them on the Yelp business dataset.

The new algorithms have also been demonstrated in several places:

Installation

  1. Download the jar into $NEO4J_HOME/plugins
  2. Add dbms.security.procedures.unrestricted=algo.* to your $NEO4J_HOME/conf/neo4j.conf
  3. Restart Neo4j

@mneedham mneedham released this Feb 2, 2018 · 241 commits to 3.2 since this release

Assets 3

Thanks a lot to Paul Horn and Martin Knobloch from Avantgarde Labs for their tireless work on the graph algorithms. Thanks also to Tomasz Bratanic for the great documentation work.

New algorithms

More support for large Graphs

In the previous release we added support for large graphs with the graph:huge config parameter.
This release adds huge graph support to the following algorithms:

  • Closeness Centrality
  • Harmonic Centrality
  • Union Find
  • Strongly Connected Components
  • Triangle Counting
  • Louvain

Graph Loading

It can take some time to load large graphs into the algorithm data structures, so you can now pre-load graphs and then later refer to them by name when calling the graph algorithms.
After usage they can be removed from memory to free resources used.

Learn more in the README

Documentation

You can find documentation for the new algorithms and examples of how to apply them on the Yelp business dataset.

The new algorithms have also been demonstrated in several places:

Installation

  1. Download the jar into $NEO4J_HOME/plugins
  2. Add dbms.security.procedures.unrestricted=algo.* to your $NEO4J_HOME/conf/neo4j.conf
  3. Restart Neo4j