These programs compute the importance of a node in a dynamic network.

This program is provided as-is, with no guarantee.

Usage: 
  cat input_file | ./inondation n 
  cat input_file | ./inondation-consecutive n 

 - input_file is in the form of lines
    n1 n2 t
   where n1 and n2 are node numbers, and t is the time at which
   the interaction occurs
 - n is the total number of nodes in the network (node indices start at 0)

Output :
 lines of the form
  t sum_dist nb_pairs,
 where t is a time, and sum_dist and nb_pairs are respectively the sum of all
 time distances between all pairs of nodes that can communicate, and the 
 number of pairs of nodes that can communicate.

Variants :
 - inondation.c considers that message can be passed in a negligible amount of time,
   i.e. a message can travel along links (a,b) then (b,c) if they occur at the same
   time
 - inondation-consecutive does not allow messages to travel along links that occur
   at the same time.