Using Spider Monkey algorithm to find the top-k influencers of a network.
NOTE: The base code is originally given by the authors of this algorithm itself, which is now being modified to fit into our problem statement. Hence many parts are yet to be understood. Going through their paper(in the base folder of the repo) will help understand what's going on in the code.
Jagdish Chand Bansal, Harish Sharma, Shimpi Singh Jadon, and Maurice Clerc. "Spider monkey optimization algorithm for numerical optimization." Memetic computing 6, no. 1, 31-47, 2014. @link: http://smo.scrs.in/