This Algorithm provides a way to determine communities among a network
for detailed information take a look at this link
It is very simple to understand and contains only 5 steps of operations .
This algorithm is done in near linear time and it is a very big advantage .
One of the most interesting parts of this schema is that we need no additional data for separating the communities .
In this algorithm and in 3 steps we are doing some works randomly , but one of them can cause wrong community sepration for us and finally the community detection will fail .
Simply we are reading network data from smple directory . you can add any file you want to use in algorithm to this directory , but it should support the standard structure we have in project (take look at karate_club.txt)
As told above for this project we are using one data set (karate club data set) at this project , but feel free to use others .