nuget
The implementation of the SELECT-NEIGHBORS-HEURISTIC(q, C, M, lc, extendCandidates, keepPrunedConnections) algorithm. Article: Section 4. Algorithm 4.
NodeAlg4
01 Syntax
Microsoft.VisualBasic.Data.GraphTheory.KNearNeighbors.HNSW.NodeAlg4`2
02 Methods
| Name | Overloads | Summary |
|---|---|---|
| .ctor | 1 | Initializes a new instance of the NodeAlg4 class. |
| SelectBestForConnecting | 1 |
03 Members
Initializes a new instance of the NodeAlg4 class.
Parameters
| Name | Type | Description |
|---|---|---|
id | Int32 | The identifier of the node. |
item | `0 | The item which is represented by the node. |
maxLevel | Int32 | The maximum level until which the node exists. |
distance | Func(Of `0, `0, `1) | The distance function for attached items. |
parameters | Parameters(Of `0, `1) | The parameters of the algorithm. |
SelectBestForConnecting(
IList(Of Node(Of `0, `1)))