This file is free only for academic users.
Author: Min Li

DESCRIPTION
The HC-PIN algorithm is implemented in C++.  It takes an undirected graph as input and clusters it. 
The clusters whose sizes are larger than or equal to a certain threshold will be writen out
to a file Ħ°*_Complex.txtĦħ. There are several user-input parameters that affect
the algorithm's behaviour.

SYNOPSIS
   ./MFinder Input_filename Threshold_lambda Threshold _Size 

OPTIONS
    (1) Input_filename	
    HC-PIN reads the input graph from an input file. This file must have a very 
strict format. Format of the input file is as followed:    
    e.g.,  node1  node2 weight
    an example file is provided. (test.txt)
    
    When unweighted graph is used, the weight equals to 1.

    (2) Threshold_lambda 
    The variation of "Threshold_lambda" will affect the clustering results. In 
general, a real number between 1.0 and 2.0 is suggested. 

    (3) Threshold _Size
    The clusters whose sizes are smaller than "Threshold _Size" will not be writen out. 

IMPLEMENTATION
    If you have the "make" utility (as any Unix system has), you can compile with "make".
    It has been test on:
       * GNU£ŻLinux (i386) 3.1 with GNU g++ 3.3.5, 3.4.4, and 4.1.0
       * Windows XP/Cygwin 1.4
 
 EXAMPLE
    ./MFinder  test.txt  1.0f  5