On Sat, Feb 27, 2010 at 8:07 PM, Ryan Hinton <iob...@email.com> wrote: > Actually, I've considered dropping back to the Graph class. I'm working > with error correcting codes whose decoding algorithms are naturally > described as message passing on an associated graph (LDPC codes). And the > associated graphs are bipartite. So naturally I used the BipartiteGraph > class!
Aahh, very interesting. If you have coding theory patches to add, I would be happy to try to referee them. > > Personally, the only bipartite "feature" I use are the partition sets. I > often want to iterate over all of a certain node type. I have the > information nodes on the left and constraint nodes on the right. In fact, > it would probably be less work for me to use a Graph and maintain these sets > manually. > Eventually, it would be nice if someone in your situration could just use the BipartiteGraph class, since that is what is most natural. > In general, the bipartite nature of a graph can be exploited for matching > and coloring, planarity, etc. So there are opportunities for optimized > algorithms. Take a look at trac #1941 for the big picture, and #8329, > #8330, #8331, and #8350 (all linked from #1941) for attacks on a few > specific issues. > > Enjoy! > > - Ryan > > Nathann Cohen wrote: >> >> Hello everybody !!! >> >> I followed your conversation on Sage-devel (http://bit.ly/bHTOHm), and >> I felt a bit as an outsider as I never used this class.. Could you >> tell me what you expect from it, or what you use it for ? I can not >> dream of a situation in which I would prefer it to the usual Graph >> class..... >> >> Thank you :-) >> >> Nathann > > --- > Ryan Hinton > iob...@email.com > > -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
