create method which compares graph properties of each network to the merged network

[jessLryan]

Once we have merged the original pair of networks n1 and n2 to form n3, we wish to compare each network to n3. For now, let’s also compare the networks to each other directly. One aspect of this comparison is to compare graph theoretic properties of the networks e.g. number of nodes, average degree, number of edges, the connectedness of each network (e.g. number of connected components). For now, let’s simply print out the result of the comparison. Let’s compare the full networks at the moment - in the future we may wish to compare by country for example.

[GbotemiB]

I have been doing some reading on graph theories.

I also think it is related to #2