Some operations could be done in less time by changing some of the data structures.
For example, instead of using an allocation matrix with users rows and facilities columns (in which each cell is the kth level of closeness), one of users rows and closeness columns (each cell being a facility) would allow to get the alpha-neighbors in O(1).
Some operations could be done in less time by changing some of the data structures.
For example, instead of using an allocation matrix with
users
rows andfacilities
columns (in which each cell is the kth level of closeness), one ofusers
rows andcloseness
columns (each cell being a facility) would allow to get the alpha-neighbors in O(1).