Graph Pattern Matching: selector SHORTEST k PATHS

### API

Other

### Description

Non-deterministic: returns the top k shortest paths from each partition, ranked in ascending path length

```
MATCH p = SHORTEST 2 [PATHS] (a:Person)-[:X]->+(b:Manager)
RETURN p
```