Home
last modified time | relevance | path

Searched refs:neighbor_distances (Results 1 – 15 of 15) sorted by relevance

/dports/math/py-hdbscan/hdbscan-0.8.27/hdbscan/
H A Dprediction.py146 def _find_neighbor_and_lambda(neighbor_indices, neighbor_distances, argument
177 point_core_distances = neighbor_distances[min_samples] * np.ones(
182 neighbor_distances
256 neighbor_distances, core_distances, argument
392 neighbor_distances, neighbor_indices = \
401 neighbor_distances[i],
471 neighbor_distances, neighbor_indices = \
496 neighbor_distances[i],
504 if neighbor_distances[i].min() == 0:
556 neighbor_distances, neighbor_indices = \
[all …]
H A Dflat.py338 neighbor_distances, neighbor_indices = prediction_data.tree.query(
347 neighbor_distances[i],
453 neighbor_distances, neighbor_indices = \
464 neighbor_distances[i],
/dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/graph/
H A D_graph.py123 neighbor_distances = neighbor_distances_full[neighbors_mask]
128 data = neighbor_distances
132 image_r[indices], image_r[neighbor_indices], neighbor_distances
/dports/math/py-pynndescent/pynndescent-0.5.4/pynndescent/
H A Dgraph_utils.py168 def adjacency_matrix_representation(neighbor_indices, neighbor_distances): argument
174 neighbor_distances[neighbor_distances == 0.0] = FLOAT32_EPS
180 result.data = neighbor_distances.ravel()
/dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/contrib/routing/
H A Dinitialization.py64 for a, neighbor_distances in nx.shortest_path_length(device_graph)
65 for b, d in neighbor_distances.items()
H A Dgreedy.py119 for a, neighbor_distances in nx.shortest_path_length(device_graph)
120 for b, d in neighbor_distances.items()
/dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/contrib/routing/
H A Dinitialization.py64 for a, neighbor_distances in nx.shortest_path_length(device_graph)
65 for b, d in neighbor_distances.items()
H A Dgreedy.py122 for a, neighbor_distances in nx.shortest_path_length(device_graph)
123 for b, d in neighbor_distances.items()
/dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/contrib/routing/
H A Dinitialization.py64 for a, neighbor_distances in nx.shortest_path_length(device_graph)
65 for b, d in neighbor_distances.items()
H A Dgreedy.py122 for a, neighbor_distances in nx.shortest_path_length(device_graph)
123 for b, d in neighbor_distances.items()
/dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/contrib/routing/
H A Dinitialization.py64 for a, neighbor_distances in nx.shortest_path_length(device_graph)
65 for b, d in neighbor_distances.items()
H A Dgreedy.py122 for a, neighbor_distances in nx.shortest_path_length(device_graph)
123 for b, d in neighbor_distances.items()
/dports/science/py-cirq-ionq/Cirq-0.13.1/cirq-core/cirq/contrib/routing/
H A Dinitialization.py64 for a, neighbor_distances in nx.shortest_path_length(device_graph)
65 for b, d in neighbor_distances.items()
H A Dgreedy.py122 for a, neighbor_distances in nx.shortest_path_length(device_graph)
123 for b, d in neighbor_distances.items()
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/common/include/pcl/range_image/impl/
H A Drange_image.hpp1060 std::vector<float> neighbor_distances (blocksize); in getSquaredDistanceOfNthNeighbor() local
1069 float& neighbor_distance = neighbor_distances[neighbor_counter++]; in getSquaredDistanceOfNthNeighbor()
1073 …std::sort (neighbor_distances.begin (), neighbor_distances.begin () + neighbor_counter); // Norma… in getSquaredDistanceOfNthNeighbor()
1076 return neighbor_distances[n-1]; in getSquaredDistanceOfNthNeighbor()