how to find k components in a directed graph using Girvan-Newman algorithm? -


i aware of girvan - newman algorithm - here algorithm :

  1. the betweenness of existing edges in network calculated first.
  2. the edge highest betweenness removed.
  3. the betweenness of edges affected removal recalculated.
  4. steps 2 , 3 repeated until no edges remain.

but want use algorithm find k components in directed graph, k given integer.
how can this? possible?
thanks.

if graph directed, need process directed version of edgebetweenness, i.e. count directed shortest paths going through edge.

regarding parameter k, must remove central links until obtain k separated components. in other words, don't need apply step 4 until no edge remain: can stop before, when you've reached required k. nodes contained in resulting components correspond communities initial graph.


Comments

Popular posts from this blog

angularjs - ADAL JS Angular- WebAPI add a new role claim to the token -

php - CakePHP HttpSockets send array of paramms -

node.js - Using Node without global install -