For Go syntax , if I have a cyclic directed graph, I would like to traverse from one the vertex and get the minimal spanning tree.
Q1. Will Nebula automatically handle the ring or not?
Q2. If I didn’t give N, how many hops will Nebula traverse?
Q3. Based on Q2, without N, only given beginning vertex, and a multi-layer graph, what will get with GO GQL?
For example, A -> B -> C, B -> D -> A, C -> F -> A, “V1 -> V2” means V1 to V2
Looking forward to the response,