Re: Graph.pm: How do I represent one-way dependency?

[LanX]

Directed graph doesn't mean that you are not allowed to add an edge in the opposite direction.

Think of people with the directed relation "likes".

I know many couples where it goes in both directions.

update

you probably want to test is_acyclic to guaranty meaningful "dependencies".

[jkeenan1]

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. :-)

[LanX]

so what is your question then?

update

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

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

[LanX]

Actually this was not totally accurate

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. ;)