The ‘strongest’ paths are the shortest/highest weighted paths. Paths are arranged from the ‘strongest’ at the bottom to the ‘weakest’ at the top. A detailed explanation for the algorithm used to determine path strengths can be found here.

Search for the source neuron to start from (Note: query is directional)

Search for the target neuron

Maximum number of paths to return (only the ‘strongest’ paths will be returned)

A minimum weight for the synapse count of each connection can be applied, paths containing individual connections below this minimum will not be returned