Re: [boost] [BGL] Unused parameter "inf" in dijkstra_shortest_paths?

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2004-06-30 11:19:31

That looks like a copy-paste error. The no_init version of Dijkstra's
does not need the inf parameter (whereas the other version does).

I've checked in the change.

Cheers,
Jeremy

On Apr 19, 2004, at 9:43 AM, Douglas Gregor wrote:

> Hmmm, this could be a bug, but I don't have time to look into it now:
>
> /home/gregod/Projects/Boost/boost/boost/graph/ 
> dijkstra_shortest_paths.hpp: In
>    function `void boost::dijkstra_shortest_paths_no_init(const
>    VertexListGraph&, typename  
> boost::graph_traits<G>::vertex_descriptor,
>    PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine,
> DistInf,
>    DistZero, DijkstraVisitor) [with VertexListGraph =
>    boost::adjacency_list<boost::listS, boost::vecS,  
> boost::bidirectionalS,
>    boost::property<boost::vertex_name_t, std::string,  
> boost::no_property>,
>    boost::property<boost::edge_name_t, std::string,
>    boost::property<boost::edge_length_t, double,
>    boost::property<boost::edge_speed_limit_t, int,
>    boost::property<boost::edge_direction_t, char,
>    boost::property<boost::edge_snow_route_t, bool, boost::no_property>  
> > > >
>> ,
>    boost::no_property, boost::listS>, DijkstraVisitor =
>    boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap =
>     
> boost::iterator_property_map<__gnu_cxx:: 
> __normal_iterator<Intersection*,
>    std::vector<Intersection, std::allocator<Intersection> > >,
>     
> boost::vec_adj_list_vertex_id_map<boost::property<boost:: 
> vertex_name_t,
>    std::string, boost::no_property>, size_t>, Intersection,  
> Intersection&>,
>    DistanceMap =
>    boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*,
>    std::vector<double, std::allocator<double> > >,
>     
> boost::vec_adj_list_vertex_id_map<boost::property<boost:: 
> vertex_name_t,
>    std::string, boost::no_property>, size_t>, double, double&>,  
> WeightMap =
>    boost::adj_list_edge_property_map<boost::bidirectional_tag, double,
> double&,
>    size_t, boost::property<boost::edge_name_t, std::string,
>    boost::property<boost::edge_length_t, double,
>    boost::property<boost::edge_speed_limit_t, int,
>    boost::property<boost::edge_direction_t, char,
>    boost::property<boost::edge_snow_route_t, bool, boost::no_property>  
> > > >
>> ,
>    boost::edge_length_t>, IndexMap =
>     
> boost::vec_adj_list_vertex_id_map<boost::property<boost:: 
> vertex_name_t,
>    std::string, boost::no_property>, size_t>, Compare =  
> std::less<double>,
>    Combine = boost::closed_plus<double>, DistInf = double, DistZero =
> double]':
> /home/gregod/Projects/Boost/boost/boost/graph/ 
> dijkstra_shortest_paths.hpp:171:
> warning: unused
>    parameter `double inf'
> /home/gregod/Projects/Boost/boost/boost/graph/ 
> dijkstra_shortest_paths.hpp: In
>    function `void boost::dijkstra_shortest_paths_no_init(const
>    VertexListGraph&, typename  
> boost::graph_traits<G>::vertex_descriptor,
>    PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine,
> DistInf,
>    DistZero, DijkstraVisitor) [with VertexListGraph =
>    boost::adjacency_list<boost::listS, boost::vecS,  
> boost::bidirectionalS,
>    boost::property<boost::vertex_name_t, std::string,  
> boost::no_property>,
>    boost::property<boost::edge_name_t, std::string,
>    boost::property<boost::edge_length_t, double,
>    boost::property<boost::edge_speed_limit_t, int,
>    boost::property<boost::edge_direction_t, char,
>    boost::property<boost::edge_snow_route_t, bool, boost::no_property>  
> > > >
>> ,
>    boost::no_property, boost::listS>, DijkstraVisitor =
>    boost::dijkstra_visitor<boost::null_visitor>, PredecessorMap =
>     
> boost::iterator_property_map<__gnu_cxx:: 
> __normal_iterator<Intersection*,
>    std::vector<Intersection, std::allocator<Intersection> > >,
>     
> boost::vec_adj_list_vertex_id_map<boost::property<boost:: 
> vertex_name_t,
>    std::string, boost::no_property>, size_t>, Intersection,  
> Intersection&>,
>    DistanceMap =
>    boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*,
>    std::vector<double, std::allocator<double> > >,
>     
> boost::vec_adj_list_vertex_id_map<boost::property<boost:: 
> vertex_name_t,
>    std::string, boost::no_property>, size_t>, double, double&>,  
> WeightMap =
>    TravelTimePropertyMap, IndexMap =
>     
> boost::vec_adj_list_vertex_id_map<boost::property<boost:: 
> vertex_name_t,
>    std::string, boost::no_property>, size_t>, Compare =  
> std::less<double>,
>    Combine = boost::closed_plus<double>, DistInf = double, DistZero =
> double]':
> /home/gregod/Projects/Boost/boost/boost/graph/ 
> dijkstra_shortest_paths.hpp:171:
> warning: unused
>    parameter `double inf'
>
> 	Doug
> _______________________________________________
> Unsubscribe & other changes:  
> http://lists.boost.org/mailman/listinfo.cgi/boost
>
_______________________________________________
Jeremy Siek <jsiek_at_[hidden]>
http://www.osl.iu.edu/~jsiek
Ph.D. Student, Indiana University Bloomington
C++ Booster (http://www.boost.org)
_______________________________________________