Here are two requirements:
Given a node v1, retrieve the n-degree relationships of v1. For example, retrieve the 1st-degree relationships, 2nd-degree relationships, 3rd-degree relationships, and so on, without considering the type of edges.
Given two nodes v1 and v2, retrieve the k-shortest paths from v1 to v2. For example, retrieve the top 10 shortest paths.
Here is the schema for the labels. enter image description here Below are the types of edges. enter image description here
