
1 Apr
2007
1 Apr
'07
4:35 p.m.
Aaron Windsor schrieb:
Hi all,
I've implemented a small suite of tools for dealing with planar graphs and would like to add it to the BGL. The core of this suite is built around the recent Boyer-Myrvold algorithm for planarity testing/embedding. (see http://www.emis.de/journals/JGAA/accepted/2004/BoyerMyrvold2004.8.3.pdf)
Wow - just in time. I am re-implementing a planar separator algorithm which was done using LEDA graphs. I'll take a look at it, but not today ... Have you specified concepts for planar graphs? If so, maybe I can pimp the leda_graph.hpp accordingly.