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

31 May 2014


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


On 30 May 2014 18:58, Jeremiah Willcock  wrote:
...
...
From: Jeremy Murphy 
To: boost-users@lists.boost.org
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@lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users