|
bitrl & cuberl Documentation
Simulation engine for reinforcement learning agents
|
Namespaces | |
| namespace | astar_impl |
| namespace | containers |
| namespace | rl |
| namespace | utils |
Functions | |
| template<typename GraphTp , typename H > | |
| std::multimap< uint_t, uint_t > | a_star_search (GraphTp &g, typename GraphTp::vertex_type &start, typename GraphTp::vertex_type &end, const H &h) |
| Simple implementation of A* algorithm at the moment the algorithm is only usable with a boost_unidirected_serial_graph graph. | |
| template<typename IdTp > | |
| std::vector< IdTp > | reconstruct_a_star_path (const std::multimap< IdTp, IdTp > &map, const IdTp &start) |
| std::multimap< uint_t, uint_t > cubeai::a_star_search | ( | GraphTp & | g, |
| typename GraphTp::vertex_type & | start, | ||
| typename GraphTp::vertex_type & | end, | ||
| const H & | h | ||
| ) |
Simple implementation of A* algorithm at the moment the algorithm is only usable with a boost_unidirected_serial_graph graph.
| std::vector< IdTp > cubeai::reconstruct_a_star_path | ( | const std::multimap< IdTp, IdTp > & | map, |
| const IdTp & | start | ||
| ) |