| /dports/math/igraph/igraph-0.9.5/src/games/ |
| H A D | barabasi.c | 76 long int bagsize, start_nodes, start_edges, new_edges, no_of_edges; in igraph_i_barabasi_game_bag() local
82 start_nodes = start_from ? igraph_vcount(start_from) : 1; in igraph_i_barabasi_game_bag()
91 new_edges = (no_of_nodes - start_nodes) * no_of_neighbors; in igraph_i_barabasi_game_bag()
189 long int start_nodes, start_edges, new_edges, no_of_edges; in igraph_i_barabasi_game_psumtree_multiple() local
195 start_nodes = start_from ? igraph_vcount(start_from) : 1; in igraph_i_barabasi_game_psumtree_multiple()
204 new_edges = (no_of_nodes - start_nodes) * no_of_neighbors; in igraph_i_barabasi_game_psumtree_multiple()
296 long int start_nodes, start_edges, new_edges, no_of_edges; in igraph_i_barabasi_game_psumtree() local
302 start_nodes = start_from ? igraph_vcount(start_from) : 1; in igraph_i_barabasi_game_psumtree()
311 new_edges = (no_of_nodes - start_nodes) * no_of_neighbors; in igraph_i_barabasi_game_psumtree()
481 long int newn = start_from ? n - start_nodes : n; in igraph_barabasi_game()
[all …]
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/graph/samples/ |
| H A D | simple_max_flow_program.cc | 34 std::vector<int64_t> start_nodes = {0, 0, 0, 1, 1, 2, 2, 3, 3}; in SimpleMaxFlowProgram() local
41 for (int i = 0; i < start_nodes.size(); ++i) { in SimpleMaxFlowProgram()
42 max_flow.AddArcWithCapacity(start_nodes[i], end_nodes[i], capacities[i]); in SimpleMaxFlowProgram()
|
| H A D | assignment_min_flow.py | 30 start_nodes = [0, 0, 0, 0] + [
51 for i in range(len(start_nodes)):
52 min_cost_flow.AddArcWithCapacityAndUnitCost(start_nodes[i],
|
| H A D | balance_min_flow.py | 32 start_nodes = ([0, 0] + [11, 11, 11] + [12, 12, 12] + [
56 for i in range(0, len(start_nodes)):
57 min_cost_flow.AddArcWithCapacityAndUnitCost(start_nodes[i],
|
| H A D | simple_min_cost_flow_program.cc | 34 std::vector<int64_t> start_nodes = {0, 0, 1, 1, 1, 2, 2, 3, 4}; in SimpleMinCostFlowProgram() local
45 for (int i = 0; i < start_nodes.size(); ++i) { in SimpleMinCostFlowProgram()
47 start_nodes[i], end_nodes[i], capacities[i], unit_costs[i]); in SimpleMinCostFlowProgram()
|
| H A D | assignment_min_flow.cc | 33 const std::vector<int64_t> start_nodes = {0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, in AssignmentMinFlow() local
52 for (int i = 0; i < start_nodes.size(); ++i) { in AssignmentMinFlow()
54 start_nodes[i], end_nodes[i], capacities[i], unit_costs[i]); in AssignmentMinFlow()
|
| H A D | balance_min_flow.cc | 34 const std::vector<int64_t> start_nodes = { in BalanceMinFlow() local
58 for (int i = 0; i < start_nodes.size(); ++i) { in BalanceMinFlow()
60 start_nodes[i], end_nodes[i], capacities[i], unit_costs[i]); in BalanceMinFlow()
|
| H A D | simple_max_flow_program.py | 32 start_nodes = [0, 0, 0, 1, 1, 2, 2, 3, 3]
39 for arc in zip(start_nodes, end_nodes, capacities):
|
| H A D | simple_min_cost_flow_program.py | 32 start_nodes = [0, 0, 1, 1, 1, 2, 2, 3, 4]
43 for arc in zip(start_nodes, end_nodes, capacities, unit_costs):
|
| /dports/net-p2p/zetacoin/zetacoin-0.13.2.1/qa/rpc-tests/ |
| H A D | reindex.py | 11 start_nodes,
25 self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
32 self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, extra_args)
|
| /dports/net-p2p/zetacoin-utils/zetacoin-0.13.2.1/qa/rpc-tests/ |
| H A D | reindex.py | 11 start_nodes,
25 self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
32 self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, extra_args)
|
| /dports/net-p2p/zetacoin-daemon/zetacoin-0.13.2.1/qa/rpc-tests/ |
| H A D | reindex.py | 11 start_nodes,
25 self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
32 self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, extra_args)
|
| /dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/stdlib/src/ |
| H A D | pool.erl | 69 Nodes = start_nodes(Hosts, Name, Args),
106 start_nodes([], _, _) -> []; function
107 start_nodes([Host|Tail], Name, Args) -> function
111 [Node | start_nodes(Tail, Name, Args)];
114 start_nodes(Tail, Name, Args);
116 [Node | start_nodes(Tail, Name, Args)]
|
| /dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/stdlib/src/ |
| H A D | pool.erl | 69 Nodes = start_nodes(Hosts, Name, Args),
106 start_nodes([], _, _) -> []; function
107 start_nodes([Host|Tail], Name, Args) -> function
111 [Node | start_nodes(Tail, Name, Args)];
114 start_nodes(Tail, Name, Args);
116 [Node | start_nodes(Tail, Name, Args)]
|
| /dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/stdlib/src/ |
| H A D | pool.erl | 69 Nodes = start_nodes(Hosts, Name, Args),
108 start_nodes([], _, _) -> []; function
109 start_nodes([Host|Tail], Name, Args) -> function
113 [Node | start_nodes(Tail, Name, Args)];
116 start_nodes(Tail, Name, Args);
118 [Node | start_nodes(Tail, Name, Args)]
|
| /dports/lang/erlang-wx/otp-OTP-24.1.7/lib/stdlib/src/ |
| H A D | pool.erl | 69 Nodes = start_nodes(Hosts, Name, Args),
106 start_nodes([], _, _) -> []; function
107 start_nodes([Host|Tail], Name, Args) -> function
111 [Node | start_nodes(Tail, Name, Args)];
114 start_nodes(Tail, Name, Args);
116 [Node | start_nodes(Tail, Name, Args)]
|
| /dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/stdlib/src/ |
| H A D | pool.erl | 69 Nodes = start_nodes(Hosts, Name, Args),
106 start_nodes([], _, _) -> []; function
107 start_nodes([Host|Tail], Name, Args) -> function
111 [Node | start_nodes(Tail, Name, Args)];
114 start_nodes(Tail, Name, Args);
116 [Node | start_nodes(Tail, Name, Args)]
|
| /dports/lang/erlang/otp-OTP-24.1.7/lib/stdlib/src/ |
| H A D | pool.erl | 69 Nodes = start_nodes(Hosts, Name, Args),
106 start_nodes([], _, _) -> []; function
107 start_nodes([Host|Tail], Name, Args) -> function
111 [Node | start_nodes(Tail, Name, Args)];
114 start_nodes(Tail, Name, Args);
116 [Node | start_nodes(Tail, Name, Args)]
|
| /dports/lang/erlang-java/otp-OTP-24.1.7/lib/stdlib/src/ |
| H A D | pool.erl | 69 Nodes = start_nodes(Hosts, Name, Args),
106 start_nodes([], _, _) -> []; function
107 start_nodes([Host|Tail], Name, Args) -> function
111 [Node | start_nodes(Tail, Name, Args)];
114 start_nodes(Tail, Name, Args);
116 [Node | start_nodes(Tail, Name, Args)]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/flow/tests/ |
| H A D | test_networksimplex.py | 94 start_nodes = [0, 0, 1, 1, 1, 2, 2, 3, 4]
104 for i in range(len(start_nodes)):
106 start_nodes[i],
122 start_nodes = [0, 0, 1, 1, 1, 2, 2, 3, 4, 3]
132 for i in range(len(start_nodes)):
134 start_nodes[i],
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/webrtc/pc/ |
| H A D | rtc_stats_traversal_unittest.cc | 42 void TakeReferencedStats(std::vector<const RTCStats*> start_nodes) { in TakeReferencedStats() argument
44 start_ids.reserve(start_nodes.size()); in TakeReferencedStats()
45 for (const RTCStats* start_node : start_nodes) { in TakeReferencedStats()
|
| /dports/net-im/tg_owt/tg_owt-d578c76/src/pc/ |
| H A D | rtc_stats_traversal_unittest.cc | 42 void TakeReferencedStats(std::vector<const RTCStats*> start_nodes) { in TakeReferencedStats() argument
44 start_ids.reserve(start_nodes.size()); in TakeReferencedStats()
45 for (const RTCStats* start_node : start_nodes) { in TakeReferencedStats()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/webrtc/pc/ |
| H A D | rtc_stats_traversal_unittest.cc | 42 void TakeReferencedStats(std::vector<const RTCStats*> start_nodes) { in TakeReferencedStats() argument
44 start_ids.reserve(start_nodes.size()); in TakeReferencedStats()
45 for (const RTCStats* start_node : start_nodes) { in TakeReferencedStats()
|
| /dports/net-p2p/c-lightning/lightning-0.10.2/contrib/ |
| H A D | startup_regtest.sh | 65 start_nodes() { function
147 start_nodes "$nodes" regtest
205 start_nodes "$nodes" liquid-regtest
|
| /dports/lang/swi-pl/swipl-8.2.3/packages/paxos/test/ |
| H A D | scenario.pl | 62 - start_nodes(?List)
92 [ start_nodes([a,b]),
98 [ start_nodes([a,b]),
104 [ start_nodes([a,b]),
110 [ start_nodes([a,b]),
118 [ start_nodes([a,b,c]),
123 [ start_nodes([a,b,c]),
206 step(start_nodes(Ids), State0, State, Tick, Options) :-
|