Lines Matching refs:m_index
108 m_dist[given_node->m_index] = 0; 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()
150 m_best_edge[dest->m_index] = succ; in shortest_paths()
162 int alt = m_dist[n->m_index] + 1; in shortest_paths()
163 if (alt < m_dist[src->m_index]) in shortest_paths()
165 m_dist[src->m_index] = alt; in shortest_paths()
166 m_best_edge[src->m_index] = pred; in shortest_paths()
188 while (m_best_edge[other_node->m_index]) in get_shortest_path()
190 result.m_edges.safe_push (m_best_edge[other_node->m_index]); in get_shortest_path()
192 other_node = m_best_edge[other_node->m_index]->m_src; in get_shortest_path()
194 other_node = m_best_edge[other_node->m_index]->m_dest; in get_shortest_path()
212 return m_dist[other_node->m_index]; in get_shortest_distance()