Gremlin: Count connections ignoring edges with a parallel edge in the opposing direction
问题 I'm currently working with a graph which indicates connections between vertices. The vertices can be connected in both directions. I am interested in knowing how many vertices are connected to each other regardless both the direction of the connection or if connections exist in both directions. So for example, in the graph sketched below the total number of connected vertices would be 3 (whilst a simple edge count would tell us there are 4 Due to the directionality of the edges this isn’t the