graph-data-science | Source code for the Neo4j Graph Data Science library | Graph Database library

The documentation here https://neo4j.com/docs/graph-data-science/1.1/algorithms/bfs/#algorithms-bfs describes a callable "gds.alpha.bfs.stream".

In order to call that, to the best of my knowledge, it needs to be registered with the embedded DB. Something along the lines of

In this tutorial, it has the following example: https://neo4j.com/developer/graph-data-science/applied-graph-embeddings/ where 'embeddingSize' is used for specify the vector length of the embedding.

I have a simple graph that looks like this (a couple of persons that gave reviews to movies)

The Neo4j Data Graph Science library has an Shortest Path algorithm (https://neo4j.com/docs/graph-data-science/current/alpha-algorithms/shortest-path/). The following sequence is the example algorithm which works for my project:

I'm coming from the RDF world where named graphs are persistent and can be used like a collection of triples. Moreover you can query against one single named graph or over the whole triplestore. I'm looking for the same features (or a workaround to achive them) in Neo4j.

Neo4j's Graph Catalog is well documented. As I understood, named graphs in Neo4j are stored entirely in-memory (so lost after a restart) with a subset of nodes you define for analytic purpose.

Is there a way to create persistents named graphs in Neo4j? A graph that is stored in the disk with the data and that permits to fast access to a subset of nodes (nodes can be added or removed from the named graph).

I have a collection of nodes that make up a DAG (directed acyclic graph) with no loops guaranteed. I want to store the nodes in a database and have the database execute a search that shows me all paths between two nodes.

For example, you could think that I have the git history of a complex project.

Each node can be described with a JSON object that has:

Creating a named graph from the main Neo4j Graph is documented. Beside, one also knows how to list, drop, check if a named graph already exists, e.g. CALL gds.graph.exists('my-store-graph') YIELD exists;

However, I wonder if there is any method for cypher-query against the just created named graph?

One workaround is to push this named graph into an offline/empty Neo4j Graph, i.e. CALL gds.beta.graph.export('my-graph', { dbName: 'mydatabase' }). However, this method is less convenient because we often want to check if the named graph is projected correcly before applying, e.g. PageRank on it. And the projection can be a trial-and-error cycle.