Closed SarraLKSC closed 3 years ago
The hill climbing alrogithm is a greedy approach towards finding the k nodes with maximal influence in a social network. This file implements the algorithm on the produced csv file by the harry potter co-occurrence notebook
The hill climbing alrogithm is a greedy approach towards finding the k nodes with maximal influence in a social network. This file implements the algorithm on the produced csv file by the harry potter co-occurrence notebook