r_c_shortest_paths.hpp File Reference

#include <map>
#include <queue>
#include <vector>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <boost/property_map/property_map.hpp>

Include dependency graph for r_c_shortest_paths.hpp:

Classes
struct	boost::r_c_shortest_paths_label< Graph, Resource_Container >
class	boost::detail::ks_smart_pointer< T >
struct	boost::default_r_c_shortest_paths_visitor

Namespaces
	boost
	Duration formatting facet for input.
	boost::detail

Typedefs
typedef std::allocator< int >	boost::default_r_c_shortest_paths_allocator

Functions
template<class Graph , class Resource_Container >
bool	boost::operator== (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	boost::operator!= (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	boost::operator< (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	boost::operator> (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	boost::operator<= (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class Resource_Container >
bool	boost::operator>= (const r_c_shortest_paths_label< Graph, Resource_Container > &l1, const r_c_shortest_paths_label< Graph, Resource_Container > &l2)
template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function , class Label_Allocator , class Visitor >
void	boost::detail::r_c_shortest_paths_dispatch (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, std::vector< std::vector< typename graph_traits< Graph >::edge_descriptor > > &pareto_optimal_solutions, std::vector< Resource_Container > &pareto_optimal_resource_containers, bool b_all_pareto_optimal_solutions, const Resource_Container &rc, Resource_Extension_Function &ref, Dominance_Function &dominance, Label_Allocator, Visitor vis)
template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function , class Label_Allocator , class Visitor >
void	boost::r_c_shortest_paths (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &edge_index_map, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, std::vector< std::vector< typename graph_traits< Graph >::edge_descriptor > > &pareto_optimal_solutions, std::vector< Resource_Container > &pareto_optimal_resource_containers, const Resource_Container &rc, const Resource_Extension_Function &ref, const Dominance_Function &dominance, Label_Allocator la, Visitor vis)
template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function , class Label_Allocator , class Visitor >
void	boost::r_c_shortest_paths (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &edge_index_map, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, std::vector< typename graph_traits< Graph >::edge_descriptor > &pareto_optimal_solution, Resource_Container &pareto_optimal_resource_container, const Resource_Container &rc, const Resource_Extension_Function &ref, const Dominance_Function &dominance, Label_Allocator la, Visitor vis)
template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function >
void	boost::r_c_shortest_paths (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &edge_index_map, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, std::vector< std::vector< typename graph_traits< Graph >::edge_descriptor > > &pareto_optimal_solutions, std::vector< Resource_Container > &pareto_optimal_resource_containers, const Resource_Container &rc, const Resource_Extension_Function &ref, const Dominance_Function &dominance)
template<class Graph , class VertexIndexMap , class EdgeIndexMap , class Resource_Container , class Resource_Extension_Function , class Dominance_Function >
void	boost::r_c_shortest_paths (const Graph &g, const VertexIndexMap &vertex_index_map, const EdgeIndexMap &edge_index_map, typename graph_traits< Graph >::vertex_descriptor s, typename graph_traits< Graph >::vertex_descriptor t, std::vector< typename graph_traits< Graph >::edge_descriptor > &pareto_optimal_solution, Resource_Container &pareto_optimal_resource_container, const Resource_Container &rc, const Resource_Extension_Function &ref, const Dominance_Function &dominance)
template<class Graph , class Resource_Container , class Resource_Extension_Function >
void	boost::check_r_c_path (const Graph &g, const std::vector< typename graph_traits< Graph >::edge_descriptor > &ed_vec_path, const Resource_Container &initial_resource_levels, bool b_result_must_be_equal_to_desired_final_resource_levels, const Resource_Container &desired_final_resource_levels, Resource_Container &actual_final_resource_levels, const Resource_Extension_Function &ref, bool &b_is_a_path_at_all, bool &b_feasible, bool &b_correctly_extended, typename graph_traits< Graph >::edge_descriptor &ed_last_extended_arc)