Our idea is to visualize the process of how community detection algorithm capture the graph structure and compare the performance of different type of community detection algorithm.
With our visualizaton tool, you can upload your own csv files to define a graph structure. By clicking the submit button, you can see the each-step results of Girvan-Newman algorithm and modularity variation. Furthermore, the final results of other kinds of community detection algorithm such as Louvain are also illustrated below.
In the future we will extend our visualization tool to include more types of graph algorithms such as PageRank and add some functionality to interact with Neo4j in a better way.
If you are interested our project you can try it out:
Any suggestions about our project are welcomed and valuable for us!