6 Apr
2010
6 Apr
'10
2:48 a.m.
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
Hi Camillo, Are you planning to submit these algorithms to the BGL? They seem like they could be very useful. I'm not sure what you mean by a mixed graph, however. Andrew Sutton andrew.n.sutton@gmail.com