Bipartite graphs ?

Topics: algorithm, graph
Oct 19, 2009 at 4:48 PM


I haven't found any mentioning of bipartite graphs in QuickGraph. Is there some support for this kind of graphs ?

I am also looking for implementations of algorithms maximum matching or Dulmage-Mendelsohn decompositions.

Any ideas are welcome.



Jun 5, 2010 at 4:38 AM

I'm no expert, but you could try using tagged graphs with a boolean tag, even more with enumeration you can create n-partite graphs where n is enumeration's cardinality. Hope it works :)