Re: [Boost-users] Planar Embedding of a Graph

Subject: Re: [Boost-users] Planar Embedding of a Graph
From: Daniel Trebbien (dtrebbien_at_[hidden])
Date: 2011-01-31 21:15:26

On Mon, Jan 31, 2011 at 12:03 PM, Nitin Gangahar
<nitin.gangahar_at_[hidden]> wrote:
> Hi all!
> Â  Â  Â  I am totally new to the Boost Library. I just wanted to know if
> BGL supports finding if a graph is planar or not and also the planar
> embedding of a graph.
>
> Thanking you,
> Nitin Gangahar

Hi Nitin,

Yes, Boost Graph Library contains an implementation of the
Boyer–Myrvold planarity testing algorithm as well as an implementation
of the Chrobak–Payne straight line drawing algorithm.

A complete example of constructing a graph, checking for planarity,
and generating a straight line drawing can be found at:
http://www.boost.org/doc/libs/1_45_0/libs/graph/example/straight_line_drawing.cpp