Lines Matching refs:link
71 // First find all possible output link candidates
84 for (int link = 0; link < m_routing_table.size(); link++) {
85 if (msg_destination.intersectionIsNotEmpty(m_routing_table[link])) {
87 if (m_weight_table[link] <= min_weight)
88 min_weight = m_weight_table[link];
93 for (int link = 0; link < m_routing_table.size(); link++) {
94 if (msg_destination.intersectionIsNotEmpty(m_routing_table[link])) {
96 if (m_weight_table[link] == min_weight) {
99 output_link_candidates.push_back(link);
109 // Randomly select any candidate output link