Hello,<br />I need to convert any bidirectional graph into an adjacency_list&lt;vecS,vecS,directedS&gt;,<br />but looks like the copy constructor
cannot handle it (needs the same type in input).<br />I don't see any simple way to convert any directed graph into an
adjacency_list&lt;vecS,vecS,directedS&gt;.<br />Is there any more-or-less-simple way to do it that I don't know?<br />May be there is a way to copy
graphs constrained not by the concrete type of the graph,<br />but only, may be, on graph concepts?<br />Thanks,<br /><br />Juan<br />