Scilab Function
Last update : 5/9/2006

scidecom - calculate the community structure of the network

### Calling Sequence

  `[c,d,q,w] = scidecom(a,b)`

### Parameters

- `a` : row vector of the numbers of the tail nodes of the graph (its size is the number of edges of the graph)
- `b` : row vector of the numbers of the head nodes of the graph (its size is the number of edges of the graph)
- `c` : row vector of the numbers of the head nodes of the graph
- `d` : row vector of the numbers of the tail nodes of the graph
- `q` : the community structure parameter Q purposed by M.E.J. Newman
- `w` : the community distribution when the Q is maximum.

### Description

  In order to analyze the community structure - groups of vertices within which connections are dense but between which they are sparser, Aaron Clauset, M.E.J. Newman and Cristopher Moore present a hierarchical agglomeration algorithm for detecting the community structure. scidecom is only an interface function which calls the program 'fastcommunity_mh' (under GPL) and covert the result into matrix variables.

### Examples

       Add here scilab instructions and comments

### See Also

`ba` ,

### Authors

  Wubo