On Tue, Oct 27, 2009 at 9:31 PM, Jeremiah Willcock <jewillco@osl.iu.edu>wrote:
On Tue, 27 Oct 2009, Sandeep Gupta wrote:
The error snippet regarding predecessor map:
error: no match for call to
'(boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::error_property_not_found>) (const boost::detail::parallel::global_descriptor<unsigned int>&)'
../../../boost/property_map/parallel/impl/distributed_property_map.ipp:141: error: no match for call to
'(boost::property_reduce<boost::vertex_predecessor_t>::apply<boost::detail::error_property_not_found>) (const boost::detail::parallel::global_descriptor<unsigned int>&, boost::detail::error_property_not_found&, const boost::detail::error_property_not_found&)' ../../../boost/graph/parallel/properties.hpp:95: note: candidates are: T
boost::property_reduce<boost::vertex_predecessor_t>::apply<T>::operator()(T) const [with T = boost::detail::error_property_not_found] ../../../boost/graph/parallel/properties.hpp:96: note: T
boost::property_reduce<boost::vertex_predecessor_t>::apply<T>::operator()(T, T, T) const [with T = boost::detail::error_property_not_found]
Jeremiah, Do you think that I should file a bug report for this.
Although I was hoping (and actually needed quite urgently) that it would be minor issue and get fixed quickly.
You need to pass a predecessor map to the algorithm as one of the parameters (or put it as a part of your graph but making an external property map to give to the algorithm is easier).
Hi Jeremy,
It took me a while but I finally figure out how to pass the predecessor map. Unfortunately it doesn't have any effect. Also, I might be wrong but I don't see any logical reason why predecessor map should have any bearing on the correctness of the depth. I have attached the new code. I am not able to print out the predecessor because I am not able to figure out its type. Maybe you could help me resolve this.
It would be nice to have this code running. I need to profile graph performance on a new machine by tomorrow. Again, thanks for you patience and time. I really appreciate you looking into this. -Sandeep