|
Boost Users : |
Subject: Re: [Boost-users] [BGL]Why the output of algorithms are vertex sequence(PredecessorMap)? How about parallel edges??
From: Li Ning (Ning.c.Li_at_[hidden])
Date: 2009-05-13 01:45:09
Li Ning wrote:
>
> Question remains:
> In above helper function, the return type is hard coded to vector<int>. Is
> it possible to traits out the edge_index type of a graph type G(or some
> type else)??
>
Well, it's "typename property_traits<EdgeIndexMap>::value_type"
Thanks, all.
-- View this message in context: http://www.nabble.com/-BGL-Why-the-output-of-algorithms-are-vertex-sequence%28PredecessorMap%29--How-about-parallel-edges---tp23439356p23515707.html Sent from the Boost - Users mailing list archive at Nabble.com.
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