title: Get shortest circle path without repeating any nodes
body: <p>I need a query that will get me the shortest circle path between nodes (so if there are multiple paths just returns the shortest one). In addition, these paths shouldn't contain repeated nodes. Examples:</p>
  <p><a href="https://i.stack.imgur.com/wxR7I.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/wxR7I.png" alt="enter image description here" /></a></p>
  <p>In this case, if I pass &quot;Item B&quot; as input, I should receive the path &quot;Item B -&gt; Item C -&gt; Item E -&gt; Item B&quot; since the other path &quot;Item B -&gt; Item C -&gt; Item A -&gt; Item C -&gt; Item E - Item B&quot; not only is longer but also contains repeated nodes (Item C)</p>
  <p>Using the same picture, if I pass &quot;Item A&quot; as input, I should receive the path &quot;Item A -&gt; Item C  -&gt; Item A&quot;</p>
  <p>In addition, it would be nice if the response could include all the nodes involved, without repeating the starting and final node that is the same in all cases.</p>
  <p>Thanks in advance!</p>