Hi everybody, I am currently working on a project in which I compute cycles in directed graph. I am wondering if it would be interesting to add some of my code to Sage. For instance, I noticed that there is no function computing all cycles of a given length in a graph, or a function returning an arbitrary cycle, etc. More precisely, I am interested in the feedback vertex set problem : given a graph G, find a smallest set of vertices V such that G - V is acyclic. If so, I would create a ticket for it. It would be the first time I contribute to Sage. Moreover, if any of you has already worked on such problems, I would be more than happy to compare the code.. Alexandre Blondin Massé Laboratoire de combinatoire et d'informatique mathématique Université du Québec à Montréal
--~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
