We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 26c90f1 commit f6dc2ebCopy full SHA for f6dc2eb
README.md
@@ -46,6 +46,7 @@ G10 = knngraph(neighbors, 10);
46
% create 4-nearest neighbor graph without recomputing the knn search
47
G4 = knngraph(neighbors, 4);
48
```
49
+Since computing the knn index is the most expensive operation, precomputing it can save time if you need to build multiple graphs.
50
51
For more detailed documentation and usage, see each function's help text.
52
0 commit comments