Home
last modified time | relevance | path

Searched refs:num_arcs (Results 1 – 25 of 125) sorted by relevance

12345

/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutPool/
H A Dvrp_cp.c145 int num_arcs = 0, edge_index; in user_check_cut() local
230 cpt += num_arcs * ISIZE; in user_check_cut()
231 memcpy(indicators, cpt, num_arcs); in user_check_cut()
232 cpt += num_arcs; in user_check_cut()
246 for (jj = 0; jj < num_arcs; jj++){ in user_check_cut()
277 cpt += num_arcs * ISIZE; in user_check_cut()
278 memcpy(indicators, cpt, num_arcs); in user_check_cut()
286 for (jj = 0; jj < num_arcs; jj++){ in user_check_cut()
292 if (jj == num_arcs) lhs -= values[i]; in user_check_cut()
309 cpt += num_arcs * ISIZE; in user_check_cut()
[all …]
/dports/net/fort/FORT-validator-1.5.3/src/asn1/asn1c/
H A DOBJECT_IDENTIFIER.c193 ssize_t num_arcs; in OBJECT_IDENTIFIER__xer_body_decode() local
201 if(num_arcs < 0) { in OBJECT_IDENTIFIER__xer_body_decode()
204 } else if(num_arcs == 0) { in OBJECT_IDENTIFIER__xer_body_decode()
214 if(ret != num_arcs) in OBJECT_IDENTIFIER__xer_body_decode()
284 size_t num_arcs = 0; in OBJECT_IDENTIFIER_get_arcs() local
297 num_arcs = 2; in OBJECT_IDENTIFIER_get_arcs()
324 num_arcs++; in OBJECT_IDENTIFIER_get_arcs()
332 return num_arcs; in OBJECT_IDENTIFIER_get_arcs()
463 size_t num_arcs = 0; in OBJECT_IDENTIFIER_parse_arcs() local
489 if(num_arcs < arcs_count) arcs[num_arcs] = value; \ in OBJECT_IDENTIFIER_parse_arcs()
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/LP/
H A Dvrp_lp.c363 int num_arcs, edge_index; local
493 memcpy((char *)&num_arcs, cpt, ISIZE);
498 cpt += num_arcs * ISIZE;
499 memcpy(indicators, cpt, num_arcs);
500 cpt += num_arcs;
536 memcpy((char *)&num_arcs, cpt, ISIZE);
541 cpt += num_arcs * ISIZE;
542 memcpy(indicators, cpt, num_arcs);
576 cpt += num_arcs * ISIZE;
580 for (jj = 0; jj < num_arcs; jj++){
[all …]
H A Dvrp_lp_branch.c377 int num_arcs, edge_index ; in compute_lhs() local
416 memcpy((char *)&num_arcs, cpt, ISIZE); in compute_lhs()
417 memcpy((char *)arcs, cpt, ISIZE*(num_arcs +1)); in compute_lhs()
419 cpt+=(ISIZE*(num_arcs +1))/CSIZE; in compute_lhs()
429 for (jj=0; jj<num_arcs; jj++){ in compute_lhs()
435 if (jj==num_arcs) lhs+=bigM*values[i]; in compute_lhs()
452 memcpy((char *)&num_arcs, cpt, ISIZE); in compute_lhs()
454 memcpy((char *)arcs, cpt, ISIZE*(num_arcs)); in compute_lhs()
455 cpt+=(ISIZE*(num_arcs ))/CSIZE; in compute_lhs()
463 for (jj=0; jj<num_arcs; jj++){ in compute_lhs()
[all …]
/dports/math/py-or-tools/or-tools-9.2/examples/cpp/
H A Dparse_dimacs_assignment.h83 num_arcs(0) {} in ErrorTrackingState()
89 ArcIndex num_arcs; member
109 ArcIndex num_arcs; in ParseProblemLine() local
112 &num_arcs) != 3) || in ParseProblemLine()
121 state_.num_arcs = num_arcs; in ParseProblemLine()
123 num_nodes, num_arcs, absl::GetFlag(FLAGS_assignment_optimize_layout)); in ParseProblemLine()
157 state_.num_arcs); in ParseArcLine()
H A Dnetwork_routing_sat.cc108 int num_arcs() const { return all_arcs_.size(); } in num_arcs() function in operations_research::sat::NetworkRoutingData
304 int num_arcs = 0; in FillData() local
309 num_arcs++; in FillData()
450 const int num_arcs = data.num_arcs(); in InitArcInfo() local
474 CHECK_EQ(arc_id, num_arcs); in InitArcInfo()
537 const int num_arcs = data.num_arcs(); in Init() local
549 LOG(INFO) << " - " << num_arcs << " arcs"; in Init()
572 const int num_arcs = count_arcs(); in Solve() local
580 for (int arc = 0; arc < num_arcs; ++arc) { in Solve()
595 std::vector<IntVar> traffic_vars(num_arcs); in Solve()
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/graph/
H A Dassignment.cc27 const ArcIndex num_arcs = arc_cost_.size(); in AddArcWithCost() local
33 return num_arcs; in AddArcWithCost()
65 const ArcIndex num_arcs = arc_cost_.size(); in Solve() local
66 ForwardStarGraph graph(2 * num_nodes_, num_arcs); in Solve()
68 for (ArcIndex arc = 0; arc < num_arcs; ++arc) { in Solve()
H A Dutil.h223 graph.num_arcs()); in GraphIsSymmetric()
256 for (typename Graph::ArcIndex arc = 0; arc < graph.num_arcs(); ++arc) { in GraphIsWeaklyConnected()
265 new Graph(graph.num_nodes(), graph.num_arcs())); in CopyGraph()
281 std::unique_ptr<Graph> new_graph(new Graph(num_nodes, old_graph.num_arcs())); in RemapGraph()
306 ArcIndex num_arcs = 0; in GetSubgraphOfNodes() local
309 if (new_node_index[old_graph.Head(arc)] != -1) ++num_arcs; in GetSubgraphOfNodes()
316 std::unique_ptr<Graph> new_graph(new Graph(nodes.size(), num_arcs)); in GetSubgraphOfNodes()
330 std::unique_ptr<Graph> g(new Graph(graph.num_nodes(), graph.num_arcs())); in RemoveSelfArcsAndDuplicateArcs()
389 std::vector<int> reverse_arc(graph.num_arcs(), -1); in ComputeOnePossibleReverseArcMapping()
397 for (int arc = 0; arc < graph.num_arcs(); ++arc) { in ComputeOnePossibleReverseArcMapping()
[all …]
H A Dminimum_spanning_tree.h55 const int num_arcs = graph.num_arcs(); in BuildKruskalMinimumSpanningTreeFromSortedArcs() local
65 while (tree_arcs.size() != expected_tree_size && arc_index < num_arcs) { in BuildKruskalMinimumSpanningTreeFromSortedArcs()
92 std::vector<ArcIndex> sorted_arcs(graph.num_arcs()); in BuildKruskalMinimumSpanningTree()
/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/
H A Drouting_parameters.cc236 const int32_t num_arcs = in FindErrorInRoutingSearchParameters() local
238 if (num_arcs < 2 || num_arcs > 1e6) { in FindErrorInRoutingSearchParameters()
240 num_arcs, ". Must be between 2 and 10^6 (included)."); in FindErrorInRoutingSearchParameters()
244 const int32_t num_arcs = in FindErrorInRoutingSearchParameters() local
246 if (num_arcs < 2 || num_arcs > 1e6) { in FindErrorInRoutingSearchParameters()
249 num_arcs, ". Must be between 2 and 10^6 (included)."); in FindErrorInRoutingSearchParameters()
/dports/math/py-or-tools/or-tools-9.2/examples/contrib/
H A Dmax_flow_winston1.py58 num_arcs = len(arcs)
69 for k in range(num_arcs):
92 for i in range(num_arcs):
98 flow[arcs[k][0], arcs[k][1]] for k in range(num_arcs) if arcs[k][1] == i
101 flow[arcs[k][0], arcs[k][1]] for k in range(num_arcs) if arcs[k][0] == i
H A Dmax_flow_winston1.cs55 int num_arcs = arcs1.GetLength(0); in Solve()
56 IEnumerable<int> ARCS = Enumerable.Range(0, num_arcs); in Solve()
57 int[,] arcs = new int[num_arcs, 2]; in Solve()
67 int[,] mat = new int[num_arcs, num_arcs]; in Solve()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/
H A Dvrp_cg.c1015 int num_arcs, edge_index ; local
1086 memcpy((char *)&num_arcs, cpt, ISIZE);
1091 cpt += num_arcs * ISIZE;
1092 memcpy(indicators, cpt, num_arcs);
1093 cpt += num_arcs;
1112 if (jj == num_arcs) lhs += bigM;
1129 cpt += num_arcs * ISIZE;
1130 memcpy(indicators, cpt, num_arcs);
1143 if (jj == num_arcs) lhs -= 1;
1157 cpt += num_arcs * ISIZE;
[all …]
/dports/audio/rhvoice/RHVoice-1.2.4/src/core/
H A Dfst.cpp61 uint32_t num_arcs; in state() local
62 if(!io::read_integer(in,num_arcs)) in state()
64 if(num_arcs>0) in state()
66 arcs.reserve(num_arcs); in state()
67 for(uint32_t i=0;i<num_arcs;++i) in state()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/Decomp/
H A Dmy_decomp_user.c1621 num_arcs = lp_data->m - 1;
1870 num_arcs = lp_data->m - 1;
2009 (num_arcs + 2) * ISIZE + num_arcs + (num_fracs + 1) * DSIZE;
2018 cpt += ISIZE * num_arcs;
2020 cpt += num_arcs;
2155 num_arcs = n->edgenum;
2157 num_arcs;
2176 for (i = 0; i < num_arcs; i++)
2194 cpt += num_arcs * ISIZE;
2282 int i, num_arcs, equality; local
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/
H A Dcore_numbers_test.cpp78 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2() local
80 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
107 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3() local
109 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/
H A Dcore_numbers_test.cpp78 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2() local
80 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
107 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3() local
109 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/
H A Dcore_numbers_test.cpp78 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2() local
80 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
107 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3() local
109 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()
/dports/databases/percona57-server/boost_1_59_0/libs/graph/test/
H A Dcore_numbers_test.cpp78 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2() local
80 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
107 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3() local
109 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/
H A Dcore_numbers_test.cpp78 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2() local
80 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
107 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3() local
109 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()
/dports/databases/percona57-client/boost_1_59_0/libs/graph/test/
H A Dcore_numbers_test.cpp78 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2() local
80 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
107 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3() local
109 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/
H A Dcore_numbers_test.cpp78 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2() local
80 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
107 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3() local
109 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/
H A Dcore_numbers_test.cpp78 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2() local
80 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
107 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3() local
109 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()
/dports/math/py-or-tools/or-tools-9.2/ortools/sat/
H A Dcircuit.h169 const int num_arcs = tails->size(); in ReindexArcs() local
170 if (num_arcs == 0) return 0; in ReindexArcs()
174 for (int arc = 0; arc < num_arcs; ++arc) { in ReindexArcs()
187 for (int arc = 0; arc < num_arcs; ++arc) { in ReindexArcs()
/dports/devel/hyperscan/boost_1_75_0/libs/graph/test/
H A Dcore_numbers_test.cpp85 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2() local
87 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
119 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3() local
121 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()

12345