Re: [Boost-users] Directed graph, incoming edges

Subject: Re: [Boost-users] Directed graph, incoming edges
From: Jeremy Murphy (jeremy.william.murphy_at_[hidden])
Date: 2014-05-30 23:58:14

Ahhh, thank you.  I had misinterpreted bidirectional it to mean undirected,
silly me.

On 30 May 2014 18:58, Jeremiah Willcock <jewillco_at_[hidden]> wrote:

> > From: Jeremy Murphy <jeremy.william.murphy_at_[hidden]>
> >To: boost-users_at_[hidden]
> >Sent: Thursday, May 29, 2014 11:33 PM
> >Subject: [Boost-users] Directed graph, incoming edges
> >
> >
> >
> >Just wondering what people generally do when they want to model a
> directed graph but they also want efficient access to the incoming edges of
> a vertex?
> >Make a bidirectional graph and store directionality as a property of an
> edge?  Thanks, cheers.
>
> A bidirectional graph already has directed edges -- it just has access to
> in edges as well as out edges.
>
> -- Jeremiah Willcock
>
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>