Hi,

I am new to the Neo4j community and have a question about the algo.allShortestPaths.stream algorithm.

I have modelled a warehouse graph in neo4j, in which I have the following Node types:

- AisleLocation: a location in an aisle on which you can walk. (with property 'name')
- Rack: a rack where products are stored. (with property 'name')

Nodes are connected by the relationship CONNECTS, which has a property 'distance' describing the distance between each of the connected nodes.

Rack nodes are never connected directly to each other, but always connected via an AisleLocation.

I now want to find the shortest path (weighted on 'distance') for each possible combination of a list of Rack locations. So for example, if I have a list of Rack location names ['x', 'y', 'z'] , I want to find the shortest path distances for:

'x' --> 'y'

'x' --> 'z'

'y' --> 'x'

'y' --> 'z'

'z' --> 'x'

'z' --> 'y'

I guess I need to use the algo.allShortestPaths.stream algorithm, but I couldn't find a way to tackle my problem just yet.

Thanks in advance.

Loek