Finding Out Looped Graphs

I am trying to identify situations where I have inadvertently created edges that connect to the same vertex, resulting in F -> F and also possibly G -> F -> G scenarios. What are effective Gremlin techniques for detecting and resolving these instances?

kelvinl2816•5/2/23, 4:27 PM

You most likely want to look at the step. You can then build type queries that look for happening. You will also want to limit those queries (using or something similar) so they don't become long running if the graph is highly connected

kelvinl2816•5/2/23, 4:37 PM

Here is a very simple example

ManabuBeachOP•5/2/23, 6:04 PM