Lines Matching refs:min_sr
295 search_result_type min_sr; in graph_BMU() local
296 std::get<RADIUS>(min_sr) = DBL_MAX; in graph_BMU()
321 if (std::get<RADIUS>(sr) < std::get<RADIUS>(min_sr)) in graph_BMU()
322 min_sr = sr; in graph_BMU()
323 else if (std::get<RADIUS>(sr) == std::get<RADIUS>(min_sr)) { in graph_BMU()
324 if (std::get<XV>(sr) < std::get<XV>(min_sr)) { in graph_BMU()
325 min_sr = sr; in graph_BMU()
327 else if ((std::get<XV>(sr) == std::get<XV>(min_sr) && in graph_BMU()
328 std::get<YV>(sr) < std::get<YV>(min_sr))) { in graph_BMU()
329 min_sr = sr; in graph_BMU()
363 return min_sr; in graph_BMU()
393 search_result_type min_sr; in graph_teach() local
406 min_sr = graph_BMU(epoch % SPECULATION_CNT); //calls wait_for_all() in graph_teach()
407 double min_distance = std::get<0>(min_sr); in graph_teach()
413 std::get<XV>(min_sr), std::get<YV>(min_sr), radius, (epoch + 1) % SPECULATION_CNT); in graph_teach()
417 in[j], epoch, std::get<1>(min_sr), std::get<2>(min_sr), radius, learning_rate); in graph_teach()
423 restart_submaps(std::get<1>(min_sr), in graph_teach()
424 std::get<2>(min_sr), in graph_teach()
430 last_update = min_sr; in graph_teach()