lazysp_incsp_dijkstra.h File Reference

Adaptor to use boost::dijkstra_shortest_paths as the inner sp algorithm for pr_bgl::lazysp. More...

Go to the source code of this file.

Classes
class	pr_bgl::lazysp_incsp_dijkstra< Graph, PredecessorMap, DistanceMap, CompareFunction, CombineFunction >
	Adaptor to use boost::dijkstra_shortest_paths as the inner sp algorithm for pr_bgl::lazysp. More...
struct	pr_bgl::lazysp_incsp_dijkstra< Graph, PredecessorMap, DistanceMap, CompareFunction, CombineFunction >::throw_visitor_exception
class	pr_bgl::lazysp_incsp_dijkstra< Graph, PredecessorMap, DistanceMap, CompareFunction, CombineFunction >::throw_visitor

Functions
template<class Graph , class PredecessorMap , class DistanceMap , typename CompareFunction , typename CombineFunction >
lazysp_incsp_dijkstra< Graph, PredecessorMap, DistanceMap, CompareFunction, CombineFunction >	pr_bgl::make_lazysp_incsp_dijkstra (PredecessorMap predecessor_map, DistanceMap distance_map, CompareFunction compare, CombineFunction combine, typename boost::property_traits< DistanceMap >::value_type inf, typename boost::property_traits< DistanceMap >::value_type zero)

Detailed Description

Adaptor to use boost::dijkstra_shortest_paths as the inner sp algorithm for pr_bgl::lazysp.

Author

Chris Dellin cdell.nosp@m.in@g.nosp@m.mail..nosp@m.com

Copyright

2015 Carnegie Mellon University

License: BSD