in reply to Re^2: Graph.pm: How do I represent one-way dependency?
in thread Graph.pm: How do I represent one-way dependency?

so what is your question then?

update

are you aware that this is (the smallest possible) cycle?

   
x  <-------------> y

[download]

Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
Wikisyntax for the Monastery

Replies are listed 'Best First'.
Re^4: Graph.pm: How do I represent one-way dependency?
by LanX (Saint) on Feb 23, 2018 at 18:36 UTC
    Actually this was not totally accurate

    The smallest possible graph with a cycle is (if allowed)

     
x -------------> x

    [download]

    Unfortunately I can't draw it better, please print it out and bend the paper till both x match. ;)

    Cheers Rolf
    (addicted to the Perl Programming Language and ☆☆☆☆ :)
    Wikisyntax for the Monastery

[reply]
[d/l]

      I took the 3d loop from my paper and rotated it back into the plane of your monitor for you. :-)

      x ---.
^    |
`----'

      [download]
[reply]
[d/l]
[reply]

In Section Seekers of Perl Wisdom