The aim is to detecting the top-k densest connected subgraphs as a set of k subgraphs having the largest density in the weighted graph
The data is available on the following google drive address: https://drive.google.com/drive/folders/12DyjyPWZA4JSJRzvRjIbechTQN4TAVQg?usp=sharing