It is a practice of Girvan_Newman algorithm
Find out how this algorithm work: https://github.com/cxfcdcpu/Girvan_Newman_algorithm/wiki
How to use this project:
All method can be found in Girvan_Newman class. You can just change the graph adjenct matrix in the homework.java file and then compile and run it. Or you can just run the Homework.class. The result is the betweenness score of each node.