Home
last modified time | relevance | path

Searched refs:num_nodes_to_scan (Results 1 – 5 of 5) sorted by relevance

/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/Common/
H A Dnetwork.c363 int *nodes_to_scan, num_nodes_to_scan = 0, i; in connected() local
380 nodes_to_scan[num_nodes_to_scan++] = cur_node;/*add the first node to the in connected()
399 for (cur_node = nodes_to_scan[--num_nodes_to_scan], in connected()
414 nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end; in connected()
423 if (!num_nodes_to_scan) break; in connected()
453 int *nodes_to_scan, num_nodes_to_scan = 0, i; in flow_connected() local
470 nodes_to_scan[num_nodes_to_scan++] = cur_node;/*add the first node to the in flow_connected()
489 for (cur_node = nodes_to_scan[--num_nodes_to_scan], in flow_connected()
505 nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end; in flow_connected()
514 if (!num_nodes_to_scan) break; in flow_connected()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Common/
H A Dnetwork.c282 int *nodes_to_scan, num_nodes_to_scan = 0, i; in connected() local
299 nodes_to_scan[num_nodes_to_scan++] = cur_node;/*add the first node to the in connected()
318 for (cur_node = nodes_to_scan[--num_nodes_to_scan], in connected()
333 nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end; in connected()
342 if (!num_nodes_to_scan) break; in connected()
/dports/math/disco/DisCO-releases-1.0.0-33-g68720be/examples/VRP/
H A DVrpNetwork.cpp184 int cur_node = 0, cur_comp = 0, cur_member = 0, num_nodes_to_scan = 0; in connected() local
203 nodes_to_scan[num_nodes_to_scan++] = cur_node;/*add the first node to the in connected()
218 for (cur_node = nodes_to_scan[--num_nodes_to_scan], in connected()
229 nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end; in connected()
237 if (!num_nodes_to_scan) break; in connected()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/LP/
H A Dvrp_lp.c1062 int *nodes_to_scan, num_nodes_to_scan = 0; local
1075 nodes_to_scan[num_nodes_to_scan++] = cur_node;
1084 for (cur_node = nodes_to_scan[--num_nodes_to_scan],
1093 nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end;
1097 if (!num_nodes_to_scan) break;
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/LP/
H A Dcnrp_lp.c1608 int *nodes_to_scan, num_nodes_to_scan = 0; local
1621 nodes_to_scan[num_nodes_to_scan++] = cur_node;
1630 for (cur_node = nodes_to_scan[--num_nodes_to_scan],
1639 nodes_to_scan[num_nodes_to_scan++] = cur_edge->other_end;
1643 if (!num_nodes_to_scan) break;