in reply to Re^3: Graph.pm: How do I represent one-way dependency?
in thread Graph.pm: How do I represent one-way dependency?
The smallest possible graph with a cycle is (if allowed)
x -------------> x
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
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^5: Graph.pm: How do I represent one-way dependency?
by pryrt (Abbot) on Feb 23, 2018 at 19:48 UTC | |
by LanX (Saint) on Feb 23, 2018 at 20:46 UTC |