Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update bindings.cpp #536

Open
wants to merge 6 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
72 changes: 72 additions & 0 deletions hnswlib/hnswalg.h
Original file line number Diff line number Diff line change
Expand Up @@ -222,6 +222,78 @@ class HierarchicalNSW : public AlgorithmInterface<dist_t> {
return num_deleted_;
}

std::unordered_map<int, size_t> getNodeDegree(size_t label) const {
std::unordered_map<int, size_t> degreePerLevel;
auto search = label_lookup_.find(label);
if (search == label_lookup_.end()) {
throw std::runtime_error("Label not found");
}
tableint internalId = search->second;
if (internalId < 0 || internalId >= cur_element_count) {
throw std::invalid_argument("Node ID does not exist.");
}

else if (isMarkedDeleted(internalId)){
throw std::invalid_argument("This node ID has been previosly deleted!");
}
else{
// Degree at level 0
linklistsizeint* ll_0 = get_linklist0(internalId);
size_t degreeLevel0 = getListCount(ll_0);
degreePerLevel[0] = degreeLevel0;
// Check higher levels
int node_level = element_levels_[internalId];
for (int level = 1; level <= node_level; ++level) {
linklistsizeint* ll = get_linklist(internalId, level);
size_t degree = getListCount(ll);
degreePerLevel[level] = degree;
}
}
return degreePerLevel;
}

float getAverageDegreeAtLayer(int targetLevel) const {

if (targetLevel < 0 || targetLevel > maxlevel_){
throw std::invalid_argument("Layer not found!");
}

if (targetLevel == 0) {
return getAverageDegreeAtLayer0();
}
size_t totalDegree = 0;
size_t nodesAtLevelCount = 0;

for (size_t node_id = 0; node_id < cur_element_count; ++node_id) {
if (element_levels_[node_id] == targetLevel) {
nodesAtLevelCount++;
linklistsizeint* ll = get_linklist(node_id, targetLevel);
size_t degree = getListCount(ll);
totalDegree += degree;
}
}

if (nodesAtLevelCount == 0) return 0.0; // Avoid division by zero
return static_cast<float>(totalDegree) / nodesAtLevelCount;
}

// --------------------- //
float getAverageDegreeAtLayer0() const {
size_t totalDegree = 0;
size_t nodesAtLevelCount = 0;

for (size_t node_id = 0; node_id < cur_element_count; ++node_id) {
if (element_levels_[node_id] == 0) {
nodesAtLevelCount++;
linklistsizeint* ll = get_linklist0(node_id);
size_t degree = getListCount(ll);
totalDegree += degree;
}
}
if (nodesAtLevelCount == 0) return 0.0; // Avoid division by zero
return static_cast<float>(totalDegree) / nodesAtLevelCount;
}

std::priority_queue<std::pair<dist_t, tableint>, std::vector<std::pair<dist_t, tableint>>, CompareByFirst>
searchBaseLayer(tableint ep_id, const void *data_point, int layer) {
VisitedList *vl = visited_list_pool_->getFreeVisitedList();
Expand Down
19 changes: 19 additions & 0 deletions python_bindings/bindings.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -720,6 +720,10 @@ class Index {
size_t getCurrentCount() const {
return appr_alg->cur_element_count;
}

int getMaxLayer() const {
return appr_alg->maxlevel_;
}
};

template<typename dist_t, typename data_t = float>
Expand Down Expand Up @@ -911,6 +915,21 @@ PYBIND11_PLUGIN(hnswlib) {
py::module m("hnswlib");

py::class_<Index<float>>(m, "Index")
.def("get_max_layer", &Index<float>::getMaxLayer)
.def("get_node_degree", [](const Index<float> &index, hnswlib::labeltype label) {
auto degrees = index.appr_alg->getNodeDegree(label); // Call the getNodeDegree method from the C++ class
py::dict result; // Create a Python dictionary to hold the results
for (const auto &degree : degrees) { // Convert the C++ unordered_map to a Python dictionary
result[py::cast(degree.first)] = py::cast(degree.second);
}
return result;
}, py::arg("label"), "Retrieves the degree of a node in all levels where it exists.")

.def("get_average_degree_at_layer", [](const Index<float> &index, int layer) {
float averageDegree = index.appr_alg->getAverageDegreeAtLayer(layer); // Call the getAverageDegreeAtLayer method from the C++ class
return averageDegree;
}, py::arg("layer"), "Calculates the average node degree at the specified layer.")

.def(py::init(&Index<float>::createFromParams), py::arg("params"))
/* WARNING: Index::createFromIndex is not thread-safe with Index::addItems */
.def(py::init(&Index<float>::createFromIndex), py::arg("index"))
Expand Down