Closed GoogleCodeExporter closed 9 years ago
Sorry, this should obviously be an enhancement, not a defect.
Original comment by cmu...@gmail.com
on 11 Jun 2009 at 8:02
Doing a cycle check on every edge added seems a bit excessive and uneeded as a
class.
I do use DAGs for my work, and to confirm that a graph I have is a DAG, I typically
just make sure by checking the find_cycle function (if it doesn't return
anything,
then you're all set).
I'm just not sure that it warrants it's own class since there aren't separate
operations for it (ie. all of the algorithms written for directed graphs should
work
on DAGs).
Original comment by christian.muise
on 12 Jun 2009 at 2:51
Yes. Also, I think the best way to implement DAGs would be inheriting from
digraphs
and overwriting the add_edge() method to make the circuit checking.
I won't accept the patch. But thanks anyway for the interest. :)
Original comment by pmatiello
on 12 Jun 2009 at 4:23
Original issue reported on code.google.com by
cmu...@gmail.com
on 11 Jun 2009 at 8:01Attachments: