Boost Users :
Subject: [Boost-users] [graph] Convert bidirectional graphs into directed graphs
From: Juan Antonio Farré Basurte (jafb_at_[hidden])
Date: 2009-03-18 04:09:21
I need to convert any bidirectional graph into an adjacency_list<vecS,vecS,directedS>,
but looks like the copy constructor
cannot handle it (needs the same type in input).
I don't see any simple way to convert any directed graph into an
Is there any more-or-less-simple way to do it that I don't know?
May be there is a way to copy
graphs constrained not by the concrete type of the graph,
but only, may be, on graph concepts?
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