<?xml version="1.0" encoding="ISO-8859-1" standalone="no"?>
<!DOCTYPE MAN SYSTEM "file://D:\PROGRA~1\scilab-4.0\man/manrev.dtd">
<MAN>
  <LANGUAGE>eng</LANGUAGE>
  <TITLE>scidecom</TITLE>
  <TYPE>Scilab Function  </TYPE>
  <DATE>5-Sep-2006</DATE>
  <SHORT_DESCRIPTION name="scidecom">calculate the community structure of the network</SHORT_DESCRIPTION>

  <CALLING_SEQUENCE>
  <CALLING_SEQUENCE_ITEM>[c,d,q,w] = scidecom(a,b)</CALLING_SEQUENCE_ITEM>
  </CALLING_SEQUENCE>

  <PARAM>
  <PARAM_INDENT>

    <PARAM_ITEM>
    <PARAM_NAME>a</PARAM_NAME>
    <PARAM_DESCRIPTION>
	    <SP>
		    : row vector of the numbers of the tail nodes of the graph (its size is the number of edges of the graph)
     	    </SP>
    </PARAM_DESCRIPTION>
    </PARAM_ITEM>

    <PARAM_ITEM>
    <PARAM_NAME>b</PARAM_NAME>
    <PARAM_DESCRIPTION>
	    <SP>
		    : row vector of the numbers of the head nodes of the graph (its size is the number of edges of the graph)
     	    </SP>
    </PARAM_DESCRIPTION>
    </PARAM_ITEM>

    <PARAM_ITEM>
    <PARAM_NAME>c</PARAM_NAME>
    <PARAM_DESCRIPTION>
	    <SP>
		    : row vector of the numbers of the head nodes of the graph
	    </SP>
    </PARAM_DESCRIPTION>
    </PARAM_ITEM>

    <PARAM_ITEM>
    <PARAM_NAME>d</PARAM_NAME>
    <PARAM_DESCRIPTION>
	    <SP>
		    : row vector of the numbers of the tail nodes of the graph
	    </SP>
    </PARAM_DESCRIPTION>
    </PARAM_ITEM>

    <PARAM_ITEM>
    <PARAM_NAME>q</PARAM_NAME>
    <PARAM_DESCRIPTION>
	    <SP>
		    : the community structure parameter Q purposed by M.E.J. Newman
      	    </SP>
    </PARAM_DESCRIPTION>
    </PARAM_ITEM>

    <PARAM_ITEM>
    <PARAM_NAME>w</PARAM_NAME>
    <PARAM_DESCRIPTION>
	    <SP>
		    : the community distribution when the Q is maximum.
      	    </SP>
    </PARAM_DESCRIPTION>
    </PARAM_ITEM>
  </PARAM_INDENT>
  </PARAM>
 
  <DESCRIPTION>
     <DESCRIPTION_INDENT>
     <DESCRIPTION_ITEM>
	     <P>
		     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.
	     </P>
     </DESCRIPTION_ITEM>
     </DESCRIPTION_INDENT>
  </DESCRIPTION>

  <EXAMPLE><![CDATA[
   Add here scilab instructions and comments
  ]]></EXAMPLE>

  <SEE_ALSO>
    <SEE_ALSO_ITEM> <LINK>ba</LINK> </SEE_ALSO_ITEM>
  </SEE_ALSO>

  <AUTHORS>
    <AUTHORS_ITEM label='Wubo'>
    </AUTHORS_ITEM>
  </AUTHORS>
</MAN>
