msvcr120d.dll!__NMSG_WRITE() Unbekannt msvcr120d.dll!_abort() Unbekannt msvcr120d.dll!__wassert() Unbekannt > astar-maze.exe!boost::unordered::detail::table >,boost::array,vertex_hash,std::equal_to > > >::get_bucket(unsigned int bucket_index) Zeile 243 C++ astar-maze.exe!boost::unordered::detail::table >,boost::array,vertex_hash,std::equal_to > > >::get_previous_start(unsigned int bucket_index) Zeile 254 C++ astar-maze.exe!boost::unordered::detail::table >,boost::array,vertex_hash,std::equal_to > > >::begin(unsigned int bucket_index) Zeile 265 C++ astar-maze.exe!boost::unordered::detail::table_impl >,boost::array,vertex_hash,std::equal_to > > >::find_node_impl,std::equal_to > >(unsigned int key_hash, const boost::array & k, const std::equal_to > & eq) Zeile 248 C++ astar-maze.exe!boost::unordered::detail::table >,boost::array,vertex_hash,std::equal_to > > >::find_node(const boost::array & k) Zeile 792 C++ astar-maze.exe!boost::unordered::unordered_set,vertex_hash,std::equal_to >,std::allocator > >::find(const boost::array & k) Zeile 1167 C++ astar-maze.exe!boost::set_contains,vertex_hash,std::equal_to >,std::allocator >,boost::array >(const boost::unordered::unordered_set,vertex_hash,std::equal_to >,std::allocator > > & s, const boost::array & x) Zeile 21 C++ astar-maze.exe!boost::is_not_in_subset,vertex_hash,std::equal_to >,std::allocator > > >::operator() >(const boost::array & x) Zeile 60 C++ astar-maze.exe!boost::iterators::filter_iterator,vertex_hash,std::equal_to >,std::allocator > > >,boost::iterators::transform_iterator >,boost::iterators::counting_iterator,boost::iterators::use_default,boost::iterators::use_default> >::satisfy_predicate() Zeile 101 C++ astar-maze.exe!boost::iterators::filter_iterator,vertex_hash,std::equal_to >,std::allocator > > >,boost::iterators::transform_iterator >,boost::iterators::counting_iterator,boost::iterators::use_default,boost::iterators::use_default> >::filter_iterator,vertex_hash,std::equal_to >,std::allocator > > >,boost::iterators::transform_iterator >,boost::iterators::counting_iterator,boost::iterators::use_default,boost::iterators::use_default> >(boost::is_not_in_subset,vertex_hash,std::equal_to >,std::allocator > > > f, boost::iterators::transform_iterator >,boost::iterators::counting_iterator,boost::iterators::use_default,boost::iterators::use_default> x, boost::iterators::transform_iterator >,boost::iterators::counting_iterator,boost::iterators::use_default,boost::iterators::use_default> end_) Zeile 61 C++ astar-maze.exe!boost::vertices,boost::keep_all,boost::is_not_in_subset,vertex_hash,std::equal_to >,std::allocator > > > >(const boost::filtered_graph,boost::keep_all,boost::is_not_in_subset,vertex_hash,std::equal_to >,std::allocator > > > > & g) Zeile 289 C++ astar-maze.exe!boost::astar_search,boost::keep_all,boost::is_not_in_subset,vertex_hash,std::equal_to >,std::allocator > > > >,euclidean_heuristic,astar_goal_visitor,boost::associative_property_map,boost::array,vertex_hash,std::equal_to >,std::allocator const ,boost::array > > > >,boost::shared_array_property_map,boost::array,unsigned int> >,boost::associative_property_map,double,vertex_hash,std::equal_to >,std::allocator const ,double> > > >,boost::static_property_map,boost::grid_graph_index_map,boost::array,unsigned int>,boost::shared_array_property_map,boost::array,unsigned int> >,std::less,boost::closed_plus,double,double>(const boost::filtered_graph,boost::keep_all,boost::is_not_in_subset,vertex_hash,std::equal_to >,std::allocator > > > > & g, boost::array s, euclidean_heuristic h, astar_goal_visitor vis, boost::associative_property_map,boost::array,vertex_hash,std::equal_to >,std::allocator const ,boost::array > > > > predecessor, boost::shared_array_property_map,boost::array,unsigned int> > cost, boost::associative_property_map,double,vertex_hash,std::equal_to >,std::allocator const ,double> > > > distance, boost::static_property_map weight, boost::grid_graph_index_map,boost::array,unsigned int> index_map, boost::shared_array_property_map,boost::array,unsigned int> > color, std::less compare, boost::closed_plus combine, double inf, double zero) Zeile 366 C++ astar-maze.exe!boost::astar_search,boost::keep_all,boost::is_not_in_subset,vertex_hash,std::equal_to >,std::allocator > > > >,euclidean_heuristic,astar_goal_visitor,enum boost::graph_visitor_t,boost::bgl_named_params,double,vertex_hash,std::equal_to >,std::allocator const ,double> > > >,enum boost::vertex_distance_t,boost::bgl_named_params,boost::array,vertex_hash,std::equal_to >,std::allocator const ,boost::array > > > >,enum boost::vertex_predecessor_t,boost::bgl_named_params,enum boost::edge_weight_t,boost::no_property> > > >(const boost::filtered_graph,boost::keep_all,boost::is_not_in_subset,vertex_hash,std::equal_to >,std::allocator > > > > & g, boost::array s, euclidean_heuristic h, const boost::bgl_named_params,double,vertex_hash,std::equal_to >,std::allocator const ,double> > > >,enum boost::vertex_distance_t,boost::bgl_named_params,boost::array,vertex_hash,std::equal_to >,std::allocator const ,boost::array > > > >,enum boost::vertex_predecessor_t,boost::bgl_named_params,enum boost::edge_weight_t,boost::no_property> > > > & params) Zeile 455 C++ astar-maze.exe!maze::solve() Zeile 190 C++ astar-maze.exe!main(int argc, const char * * argv) Zeile 305 C++ [Externer Code]