Searched refs:m_dist (Results 1 – 2 of 2) sorted by relevance
69 auto_vec<int> m_dist; variable95 m_dist (graph.m_nodes.length ()), in shortest_paths()104 m_dist.quick_push (INT_MAX); in shortest_paths()108 m_dist[given_node->m_index] = 0; in shortest_paths()120 if (m_dist[queue[i]] < min_dist) in shortest_paths()122 min_dist = m_dist[idx]; in shortest_paths()146 int alt = m_dist[n->m_index] + 1; in shortest_paths()147 if (alt < m_dist[dest->m_index]) in shortest_paths()149 m_dist[dest->m_index] = alt; in shortest_paths()162 int alt = m_dist[n->m_index] + 1; in shortest_paths()[all …]
49 auto_vec<int> m_dist; variable67 m_dist (graph.m_nodes.length ()), in shortest_paths()76 m_dist.quick_push (INT_MAX); in shortest_paths()80 m_dist[origin->m_index] = 0; in shortest_paths()92 if (m_dist[queue[i]] < min_dist) in shortest_paths()94 min_dist = m_dist[idx]; in shortest_paths()115 int alt = m_dist[n->m_index] + 1; in shortest_paths()116 if (alt < m_dist[dest->m_index]) in shortest_paths()118 m_dist[dest->m_index] = alt; in shortest_paths()