Boost logo

Boost Users :

Subject: Re: [Boost-users] Directed graph, incoming edges
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2014-05-30 04:58:28


> 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 list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net