| /dports/www/osrm-backend/osrm-backend-5.26.0/src/contractor/ |
| H A D | graph_contractor.cpp | 395 for (auto &remaining : remaining_nodes) in RenumberData()
598 std::vector<RemainingNodeData> remaining_nodes; in contractGraph() local
599 remaining_nodes.reserve(number_of_nodes); in contractGraph()
606 remaining_nodes.emplace_back(node, false); in contractGraph()
644 util::Percent p(log, remaining_nodes.size()); in contractGraph()
650 while (remaining_nodes.size() > number_of_core_nodes) in contractGraph()
652 if (remaining_nodes.size() < next_renumbering) in contractGraph()
667 const NodeID node = remaining_nodes[i].id; in contractGraph()
675 stable_partition(remaining_nodes.begin(), in contractGraph()
676 remaining_nodes.end(), in contractGraph()
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/ |
| H A D | dominating.py | 53 remaining_nodes = all_nodes - dominated_nodes - dominating_set
54 while remaining_nodes:
56 v = remaining_nodes.pop()
63 remaining_nodes -= undominated_neighbors
|
| H A D | planar_drawing.py | 113 remaining_nodes = [v1]
114 while remaining_nodes:
115 parent_node = remaining_nodes.pop()
119 parent_node, left_t_child, remaining_nodes, delta_x, y_coordinate, pos
123 parent_node, right_t_child, remaining_nodes, delta_x, y_coordinate, pos
128 def set_position(parent, tree, remaining_nodes, delta_x, y_coordinate, pos): argument
137 remaining_nodes.append(child)
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/coloring/ |
| H A D | greedy_coloring.py | 140 remaining_nodes = set(G)
141 while len(remaining_nodes) > 0:
142 nodes = _maximal_independent_set(G.subgraph(remaining_nodes))
143 remaining_nodes -= nodes
|
| /dports/devel/py-python-application/python-application-2.8.0/application/debug/ |
| H A D | memory.py | 110 remaining_nodes = nodes.copy()
111 while remaining_nodes:
112 path = [next(remaining_nodes.itervalues())]
115 remaining_nodes.pop(id(node.object), None)
|
| /dports/net/openmpi/openmpi-4.1.1/opal/mca/hwloc/hwloc201/hwloc/hwloc/ |
| H A D | topology-synthetic.c | 1347 hwloc_bitmap_t remaining_nodes; in hwloc_check_memory_symmetric() local
1349 remaining_nodes = hwloc_bitmap_dup(hwloc_get_root_obj(topology)->nodeset); in hwloc_check_memory_symmetric()
1350 if (!remaining_nodes) in hwloc_check_memory_symmetric()
1354 while (!hwloc_bitmap_iszero(remaining_nodes)) { in hwloc_check_memory_symmetric()
1360 idx = hwloc_bitmap_first(remaining_nodes); in hwloc_check_memory_symmetric()
1382 …hwloc_bitmap_clr(remaining_nodes, mchild->os_index); /* cannot use parent->nodeset, some normal ch… in hwloc_check_memory_symmetric()
1388 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
1392 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
|
| /dports/graphics/blender/blender-2.91.0/source/blender/functions/intern/ |
| H A D | multi_function_network_optimization.cc | 475 Vector<MFNode *, 16> remaining_nodes; in relink_duplicate_nodes() local
487 remaining_nodes.append(node); in relink_duplicate_nodes()
490 nodes_to_check = std::move(remaining_nodes); in relink_duplicate_nodes()
|
| /dports/net/mpich/mpich-3.4.3/src/pm/hydra/tools/topo/hwloc/hwloc/hwloc/ |
| H A D | topology-synthetic.c | 1395 hwloc_bitmap_t remaining_nodes; in hwloc_check_memory_symmetric() local
1397 remaining_nodes = hwloc_bitmap_dup(hwloc_get_root_obj(topology)->nodeset); in hwloc_check_memory_symmetric()
1398 if (!remaining_nodes) in hwloc_check_memory_symmetric()
1402 while (!hwloc_bitmap_iszero(remaining_nodes)) { in hwloc_check_memory_symmetric()
1408 idx = hwloc_bitmap_first(remaining_nodes); in hwloc_check_memory_symmetric()
1428 …hwloc_bitmap_clr(remaining_nodes, mchild->os_index); /* cannot use parent->nodeset, some normal ch… in hwloc_check_memory_symmetric()
1434 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
1438 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
|
| /dports/net/mpich/mpich-3.4.3/modules/hwloc/hwloc/ |
| H A D | topology-synthetic.c | 1395 hwloc_bitmap_t remaining_nodes; in hwloc_check_memory_symmetric() local
1397 remaining_nodes = hwloc_bitmap_dup(hwloc_get_root_obj(topology)->nodeset); in hwloc_check_memory_symmetric()
1398 if (!remaining_nodes) in hwloc_check_memory_symmetric()
1402 while (!hwloc_bitmap_iszero(remaining_nodes)) { in hwloc_check_memory_symmetric()
1408 idx = hwloc_bitmap_first(remaining_nodes); in hwloc_check_memory_symmetric()
1428 …hwloc_bitmap_clr(remaining_nodes, mchild->os_index); /* cannot use parent->nodeset, some normal ch… in hwloc_check_memory_symmetric()
1434 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
1438 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
|
| /dports/net/mpich/mpich-3.4.3/src/pm/hydra2/libhydra/topo/hwloc/hwloc/hwloc/ |
| H A D | topology-synthetic.c | 1395 hwloc_bitmap_t remaining_nodes; in hwloc_check_memory_symmetric() local
1397 remaining_nodes = hwloc_bitmap_dup(hwloc_get_root_obj(topology)->nodeset); in hwloc_check_memory_symmetric()
1398 if (!remaining_nodes) in hwloc_check_memory_symmetric()
1402 while (!hwloc_bitmap_iszero(remaining_nodes)) { in hwloc_check_memory_symmetric()
1408 idx = hwloc_bitmap_first(remaining_nodes); in hwloc_check_memory_symmetric()
1428 …hwloc_bitmap_clr(remaining_nodes, mchild->os_index); /* cannot use parent->nodeset, some normal ch… in hwloc_check_memory_symmetric()
1434 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
1438 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
|
| /dports/devel/hwloc2/hwloc-2.5.0/hwloc/ |
| H A D | topology-synthetic.c | 1395 hwloc_bitmap_t remaining_nodes; in hwloc_check_memory_symmetric() local
1397 remaining_nodes = hwloc_bitmap_dup(hwloc_get_root_obj(topology)->nodeset); in hwloc_check_memory_symmetric()
1398 if (!remaining_nodes) in hwloc_check_memory_symmetric()
1402 while (!hwloc_bitmap_iszero(remaining_nodes)) { in hwloc_check_memory_symmetric()
1408 idx = hwloc_bitmap_first(remaining_nodes); in hwloc_check_memory_symmetric()
1428 …hwloc_bitmap_clr(remaining_nodes, mchild->os_index); /* cannot use parent->nodeset, some normal ch… in hwloc_check_memory_symmetric()
1434 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
1438 hwloc_bitmap_free(remaining_nodes); in hwloc_check_memory_symmetric()
|
| /dports/sysutils/garcon/garcon-4.16.1/garcon/ |
| H A D | garcon-menu-merger.c | 668 GSList *remaining_nodes = NULL; in garcon_menu_merger_remove_duplicate_paths() local
687 if (G_LIKELY (g_slist_find_custom (remaining_nodes, child, in garcon_menu_merger_remove_duplicate_paths()
690 remaining_nodes = g_slist_prepend (remaining_nodes, child); in garcon_menu_merger_remove_duplicate_paths()
699 g_slist_free (remaining_nodes); in garcon_menu_merger_remove_duplicate_paths()
|
| /dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/contrib/routing/ |
| H A D | greedy.py | 220 remaining_nodes = [node for node in self.remaining_dag.ordered_nodes() if node not in nodes]
221 for node, remaining_node in itertools.product(nodes, remaining_nodes):
|
| /dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/contrib/routing/ |
| H A D | greedy.py | 217 remaining_nodes = [node for node in self.remaining_dag.ordered_nodes() if node not in nodes]
218 for node, remaining_node in itertools.product(nodes, remaining_nodes):
|
| /dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/contrib/routing/ |
| H A D | greedy.py | 220 remaining_nodes = [node for node in self.remaining_dag.ordered_nodes() if node not in nodes]
221 for node, remaining_node in itertools.product(nodes, remaining_nodes):
|
| /dports/science/py-cirq-ionq/Cirq-0.13.1/cirq-core/cirq/contrib/routing/ |
| H A D | greedy.py | 220 remaining_nodes = [node for node in self.remaining_dag.ordered_nodes() if node not in nodes]
221 for node, remaining_node in itertools.product(nodes, remaining_nodes):
|
| /dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/contrib/routing/ |
| H A D | greedy.py | 220 remaining_nodes = [node for node in self.remaining_dag.ordered_nodes() if node not in nodes]
221 for node, remaining_node in itertools.product(nodes, remaining_nodes):
|
| /dports/math/igraph/igraph-0.9.5/src/misc/ |
| H A D | bipartite.c | 163 igraph_integer_t remaining_nodes = 0; in igraph_i_bipartite_projection() local
194 VECTOR(vertex_index)[i] = ++remaining_nodes; in igraph_i_bipartite_projection()
263 IGRAPH_CHECK(igraph_create(proj, &edges, remaining_nodes, in igraph_i_bipartite_projection()
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | bipartite.c | 161 igraph_integer_t remaining_nodes = 0; in igraph_i_bipartite_projection() local
189 VECTOR(vertex_index)[i] = ++remaining_nodes; in igraph_i_bipartite_projection()
261 IGRAPH_CHECK(igraph_create(proj, &edges, remaining_nodes, in igraph_i_bipartite_projection()
|
| /dports/net-p2p/libtorrent-rasterbar/libtorrent-rasterbar-1.2.14/test/ |
| H A D | test_dht.cpp | 3100 std::set<node_id> remaining_nodes; in TORRENT_TEST() local
3101 tbl.for_each_node(std::bind(&inserter, &remaining_nodes, _1)); in TORRENT_TEST()
3104 std::set_intersection(remaining_nodes.begin(), remaining_nodes.end() in TORRENT_TEST()
3109 TEST_EQUAL(intersection.size(), remaining_nodes.size()); in TORRENT_TEST()
|
| /dports/net-p2p/py-libtorrent-rasterbar/libtorrent-1.2.13/test/ |
| H A D | test_dht.cpp | 3100 std::set<node_id> remaining_nodes; in TORRENT_TEST() local
3101 tbl.for_each_node(std::bind(&inserter, &remaining_nodes, _1)); in TORRENT_TEST()
3104 std::set_intersection(remaining_nodes.begin(), remaining_nodes.end() in TORRENT_TEST()
3109 TEST_EQUAL(intersection.size(), remaining_nodes.size()); in TORRENT_TEST()
|