The program "epa_plos.c" generates a complex network using the introduced
"Evolutionary Preferential Attachment" algorithm. Please, note that this is a non-optimized code (optimiations has been omitted for clarity).


1.-INPUTS

The user has to set the parameters of the model. To this end one only has to
introduce the values in two different parts of the code:

  - at the definitions (located at the beginning of the code).
  - at the begining of the main function, "main()".

(The values to be inserted are comented on the source code.)


2.-OUTPUT

The program generates a single file containing the dynamical and topological
output. In this file the information of the nodes is located along the rows
(for instance, information of node "i" should be read along the row "i" of the
file). The information contained in each row is ordered as follows:

  - (index of the node), 
  - (strategy, 1 and 0 means defector and cooperator respectively), 
  - (degree of the node),
  - (neighbor_1), 
  - (neighbor_2), 
  - ..., 
  - (neighbor_degree)