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

Thanks. My vertex and edge data is all dummy data, so I can easily guarantee that it passes both is_acyclic() and is_directed_acyclic_graph. :-)
Jim Keenan

Replies are listed 'Best First'.
Re^3: Graph.pm: How do I represent one-way dependency?
by LanX (Saint) on Feb 18, 2018 at 03:04 UTC
[reply]
[d/l]
      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]

In Section Seekers of Perl Wisdom