****
Goal
****

'emm_mix' is a program written in python which implements a variant of the 
Edge-Markovian Evolving Graph Model that randomise the observed fraction of creation and deletion of links in a mobile network.

See the following articles for more information on the standard Edge-Markovian Evolving Graph Model:

- Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre
  Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale,
  Riccardo Silvestri. Rumor Spreading in Random Evolving
  Graphs. Proceedings of ESA 2013, Lecture Notes in Computer Science
  Volume 8125, pp 325-336, 2013.

- Aurélie Faure de Pebeyre, Fabien Tarissan et Julien Sopena. On the
  relevance of the edge-Markovian evolving graph model for real mobile
  networks. Proceedings of the IFIP Wireless Days conference 2013, pp
  1-6, 2013.


***********
parameters
***********

The script takes 4 parameters: 
 the size (n) of the graph, 
 the name of the file containing list of probabilities for creating new links,
 the name of the file containing the list of probabilities for deleting existing links, and
 the number (T) of time steps.

The two files containing lists of probabilities must contain one probability per line.
The number of lines must be equal to the number of time steps.

******
Output
******

The program writes on its standard output the 4-upplets describing the
creations and deletions of links in the following format:

t n1 n2 k

where k (string "A" or "S") stand for the kind of event occuring at
time t between n1 and n2:
A = added at time t
S = removed at time t