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
In reply to Re^4: Graph.pm: How do I represent one-way dependency?
by LanX
in thread Graph.pm: How do I represent one-way dependency?
by jkeenan1
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |