You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I am reading the source code. But I have a question about the local join in KGraphConstruction class.
I don't understand the update progress of the radius of Nhood. In init(), the radius is set to numeric_limits::max(). And the size of nhood.pool is set to param.L. After the join process, the radius is updated to nhood.pool.back().dist. But if the neighbors can not fill the pool size(param.L), the radius would be set to 0. This is confusing. Can you please explain the updating of radius in the construction process of KGraphConstruction?
The text was updated successfully, but these errors were encountered:
I am reading the source code. But I have a question about the local join in KGraphConstruction class.
I don't understand the update progress of the radius of Nhood. In init(), the radius is set to numeric_limits::max(). And the size of nhood.pool is set to param.L. After the join process, the radius is updated to nhood.pool.back().dist. But if the neighbors can not fill the pool size(param.L), the radius would be set to 0. This is confusing. Can you please explain the updating of radius in the construction process of KGraphConstruction?
The text was updated successfully, but these errors were encountered: