Home
last modified time | relevance | path

Searched refs:get_num_nodes (Results 1 – 25 of 73) sorted by relevance

123

/dports/games/abstreet/fast_paths-192ae1997f9857791826ac5ed16892b2f692920c/src/
H A Dlib.rs73 let mut calc = PathCalculator::new(fast_graph.get_num_nodes()); in calc_path()
81 PathCalculator::new(fast_graph.get_num_nodes()) in create_calculator()
146 let mut dijkstra = Dijkstra::new(input_graph.get_num_nodes()); in run_test_on_random_graph()
148 let mut fw = FloydWarshall::new(input_graph.get_num_nodes()); in run_test_on_random_graph()
153 let source = rng.gen_range(0, input_graph.get_num_nodes()); in run_test_on_random_graph()
204 assert_eq!(fast_graph.get_num_nodes(), loaded.get_num_nodes()); in save_to_and_load_from_disk()
220 assert_eq!(fast_graph.get_num_nodes(), loaded.get_num_nodes()); in save_to_and_load_from_disk_32()
307 input_graph.get_num_nodes(), in run_performance_test_dist_fixed_ordering()
328 input_graph.get_num_nodes(), in run_performance_test()
337 fast_graph.get_num_nodes() in print_fast_graph_stats()
[all …]
H A Ddijkstra.rs93 graph.get_num_nodes(), in do_calc_path()
236 let mut d = Dijkstra::new(g.get_num_nodes()); in simple_path()
254 let mut d = Dijkstra::new(g.get_num_nodes()); in go_around()
270 let mut d = Dijkstra::new(g.get_num_nodes()); in avoid_node()
284 let mut d = Dijkstra::new(g.get_num_nodes()); in limit_weight()
314 let mut d = Dijkstra::new(g.get_num_nodes()); in run_multiple()
H A Dfloyd_warshall.rs42 input_graph.get_num_nodes(), in prepare()
96 let mut fw = FloydWarshall::new(g.get_num_nodes()); in calc_weights()
H A Dnode_contractor.rs170 let mut dijkstra = Dijkstra::new(g.get_num_nodes()); in contract_node()
193 let mut dijkstra = Dijkstra::new(g.get_num_nodes()); in calc_priority()
206 let mut dijkstra = Dijkstra::new(g.get_num_nodes()); in calc_shortcuts()
H A Dinput_graph.rs73 pub fn get_num_nodes(&self) -> usize { in get_num_nodes() method
255 g.get_num_nodes(); in panic_if_not_frozen_get_num_nodes()
288 assert_eq!(12, g.get_num_nodes()); in num_nodes()
H A Dfast_graph_builder.rs45 fast_graph: FastGraph::new(input_graph.get_num_nodes()), in new()
46 num_nodes: input_graph.get_num_nodes(), in new()
66 if input_graph.get_num_nodes() != order.len() { in build_with_order()
H A Dpreparation_graph.rs42 let mut graph = PreparationGraph::new(input_graph.get_num_nodes()); in from_input_graph()
104 pub fn get_num_nodes(&self) -> usize { in get_num_nodes() method
H A Dfast_graph32.rs48 num_nodes: usize_to_u32(fast_graph.get_num_nodes()), in new()
201 assert_eq!(g_from32.get_num_nodes(), 5); in create()
H A Dfast_graph.rs57 pub fn get_num_nodes(&self) -> usize { in get_num_nodes() method
/dports/biology/hyphy/hyphy-2.5.33/src/core/
H A Dclasses.cp150 … while (test_node && test_node->go_down (test_node->get_num_nodes()) == this->iterator_state) {
177 long nc = get_num_nodes();
192 for (int i=1; i<=get_num_nodes(); i++) {
209 if (n->get_num_nodes() == 0) {
213 for (int i=1; i<=n->get_num_nodes(); i++) {
223 int nNodes = get_num_nodes();
224 if (nNodes==compareTo->get_num_nodes()) {
382 if ((index > 0) && (index <= get_num_nodes())){
393 if (get_child_num() < (get_parent())->get_num_nodes()) return 1;
413 if (my_index < parent->get_num_nodes()) {
[all …]
H A Dtopology.cpp176 if (theRoot->get_num_nodes() == 2) { in PostTreeConstructor()
1808 long nc1 = n1->get_num_nodes(), in internalNodeCompare()
1827 nc2 = n2->get_num_nodes(); in internalNodeCompare()
2004 if (n1->get_num_nodes() == 0) { in internalTreeCompare()
2009 long nc1 = n1->get_num_nodes(); in internalTreeCompare()
2230 int children = root->get_num_nodes(); in _recurse_and_reshuffle()
2945 if (meNode->get_num_nodes()) { in CompareTrees()
3080 long nC = iterator->get_num_nodes(); in SplitTreeIntoClusters()
3180 long nn = iterator->get_num_nodes(); in MatchTreePattern()
3227 if (myCT->get_num_nodes()==2) { in MatchTreePattern()
[all …]
H A Dtree.cpp314 if (theRoot->get_num_nodes() == 2) { in PostTreeConstructor()
343 if (theRoot->get_num_nodes() == 0) { in PostTreeConstructor()
819 long k = theNode->get_num_nodes(); in AlignNodes()
841 long descendants = theRoot->get_num_nodes(); in AlignedTipsMapping()
872 long descendants = iterator->get_num_nodes(); in AlignedTipsMapping()
894 for (long k=1; k<=theNode->get_num_nodes(); k++) { in ScaledBranchReMapping()
959 long descendants = theParent->get_num_nodes(), in ScaledBranchMapping()
1063 long descendants = theParent->get_num_nodes(),b=-1; in AssignLabelsToBranches()
1359 if (!currentNd->get_num_nodes()) { in PlainTreeString()
1828 if (child->get_num_nodes()) { // internal node in TreePSRecurse()
[all …]
H A Dtree_iterator.cpp99 return current->get_num_nodes() == 0L; in IsAtLeaf()
/dports/security/snort3/snort3-3.1.19.0/src/flow/
H A Dflow_cache.cc95 return hash_table ? hash_table->get_num_nodes() : 0; in get_count()
324 unsigned ignore_offloads = hash_table->get_num_nodes(); in prune_excess()
330 while ( hash_table->get_num_nodes() > max_cap and hash_table->get_num_nodes() > blocks ) in prune_excess()
357 if (!pruned and hash_table->get_num_nodes() > max_cap) in prune_excess()
373 if ( hash_table->get_num_nodes() <= 1 ) in prune_one()
433 unsigned flows_to_check = hash_table->get_num_nodes(); in delete_active_flows()
/dports/security/snort3/snort3-3.1.19.0/src/detection/
H A Dtag.cc438 if (!host_tag_cache->get_num_nodes() && !ssn_tag_cache->get_num_nodes()) in CheckTagList()
576 if (ssn_tag_cache->get_num_nodes() != 0) in PruneTagCache()
579 if (host_tag_cache->get_num_nodes() != 0) in PruneTagCache()
585 (ssn_tag_cache->get_num_nodes() > 0 || host_tag_cache->get_num_nodes() > 0)) in PruneTagCache()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/simplex/
H A Dnetwork_flow_def.h122 for (unsigned i = 0; i < g.get_num_nodes(); ++i) { in network_flow()
148 unsigned num_nodes = m_graph.get_num_nodes(); in initialize()
337 unsigned num_nodes = m_graph.get_num_nodes(); in is_infeasible()
440 for (unsigned i = 0; i < m_graph.get_num_nodes(); ++i) { in display_primal()
480 for (unsigned i = 0; i < m_graph.get_num_nodes(); ++i) { in display_dual()
503 unsigned root = m_graph.get_num_nodes() - 1; in display_spanning_tree()
/dports/math/z3/z3-z3-4.8.13/src/math/simplex/
H A Dnetwork_flow_def.h122 for (unsigned i = 0; i < g.get_num_nodes(); ++i) { in network_flow()
148 unsigned num_nodes = m_graph.get_num_nodes(); in initialize()
337 unsigned num_nodes = m_graph.get_num_nodes(); in is_infeasible()
440 for (unsigned i = 0; i < m_graph.get_num_nodes(); ++i) { in display_primal()
480 for (unsigned i = 0; i < m_graph.get_num_nodes(); ++i) { in display_dual()
503 unsigned root = m_graph.get_num_nodes() - 1; in display_spanning_tree()
/dports/biology/hyphy/hyphy-2.5.33/src/core/include/
H A Dclasses.h153 int get_num_nodes (void) const { in get_num_nodes() function
229 bool is_leaf (void) const {return get_num_nodes() == 0L; } in is_leaf()
H A Dtopology.h217 …erate(void) const { return theRoot && theRoot->get_num_nodes() == 1L && theRoot->go_down(1)->get_n… in IsDegenerate()
/dports/math/z3/z3-z3-4.8.13/src/ast/
H A Dfor_each_ast.cpp28 unsigned get_num_nodes(ast * n) { in get_num_nodes() function
/dports/math/libxsmm/libxsmm-1.16.3/samples/deeplearning/gxm/include/
H A DSoftmaxLossImpl.hpp44 size_t get_num_nodes() { return num_nodes; } in get_num_nodes() function in SMaxLossImpl
/dports/math/py-z3-solver/z3-z3-4.8.10/src/ast/
H A Dfor_each_ast.cpp28 unsigned get_num_nodes(ast * n) { in get_num_nodes() function
/dports/security/snort3/snort3-3.1.19.0/src/hash/
H A Dxhash.h74 unsigned get_num_nodes() in get_num_nodes() function
/dports/math/z3/z3-z3-4.8.13/src/smt/
H A Dspanning_tree_def.h34 unsigned num_nodes = m_graph.get_num_nodes(); in initialize()
424 unsigned num_nodes = m_graph.get_num_nodes(); in initialize()
445 unsigned num_nodes = m_graph.get_num_nodes(); in update()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/smt/
H A Dspanning_tree_def.h34 unsigned num_nodes = m_graph.get_num_nodes(); in initialize()
424 unsigned num_nodes = m_graph.get_num_nodes(); in initialize()
445 unsigned num_nodes = m_graph.get_num_nodes(); in update()

123