Subject: [boost] Gsoc Boost.Graph: implementing new algorithms
From: Camillo Anania (anacron10_at_[hidden])
Date: 2010-04-05 04:48:58
Hi guys,
I'm developing my thesis using BGL. Now it's some months I'm working
on it and this is what I would like to see implemented on BGL and
partially what I'm working on in those months:
- check if graph have an euler tour(is eulerian) and find one and/or
all possible euler tours
- add the support for mixed graph
- add the algorithm to find a minimum cost maximum matching
I would like to know an opinion about that. Thanks
Camillo