Write steps of Girvan- Newman Algorithm. Explain clustering of Social-Network Graphs using GN algorithm with example?

37kviews

written 6.7 years ago by

swatisharma • 1.4k

modified 5.6 years ago by

prashantsaini • 0

big data analytics

ADD COMMENT EDIT

1 Answer

2.7kviews

written 6.6 years ago by

teamques10 ★ 70k

In order to find out between edges, we need to calculate shortest paths from going through each of the edges.
Girvan - Newman Algorithm visits each node X once and computes the number of shortest paths from X to each of the other nodes that go through each of the …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.