cyper | Cython performed inline : compile and run your Cython | Data Manipulation library

Since you are basically looking for strongest one in shortest length. You can come around the performance problem with a trick. You can query the graph with fixed length than variable length. But you have to query n2-n1+1 times , in your case , 4 times , first with length 4, and then 5 and so on . You can stop querying if you find a path at any point. This approach will tremendously decrease the data loaded each time. But you have to hit the graph multiple times.Its most likely that average time taken for four hits approach will be less than single hit with variable length. The reason being you don't calculate all the paths of higher length if you find a lower length solution. Since,longer the path gets, the time taken will grow exponentially.

This is not possible only using cypher . One way is writing neo4j procedure in java and using that in cypher query . The second way is : hitting neo4j using different query. i am writing python code for your case here ,

The problem was solved by downgrading the version of Neo4J.

Version 4.0.1 uses a higher version of the bolt protocol, which isn't documented so far, and thus not used by neo4j-client.
Version 3.5 uses the old protocol (bolt version 1) and is thus compatible.

You can just supply the labels as extra arguments: