
Hello,
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 DulmageMendelsohn decompositions.
Any ideas are welcome.
Lars



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

