Context: I have students A, B, C, ..., Z that needs to work in pairs for their exam. Each student has made a wish list with 3 other students that they'd like to work with. I need to find the maximum possible pairing.
I think - maybe - that the algorithm I need is Edmond's blossom algorithm. Am I so lucky that someone has this in Racket? https://en.wikipedia.org/wiki/Blossom_algorithm http://www.cs.dartmouth.edu/~ac/Teach/CS105-Winter05/Handouts/tarjan-blossom.pdf /Jens Axel -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
