Added a plt.cla() for cleaning the canvas and tested the barabasi albert, erdos-renyi and watts strogatz topologies.
network implementation of prissoner's dilema
g.node this, g.node that
report global variables for final plot
init for all types of network
Iterative prisioner's dilemma with a measure for trust on different networks with different topologies. Changes in node strategy depend on the value of delta = fitness/tau (node trustfulness) compared to a threshold value called theta. In this way fitness is the variable that determines the shift of strategy (and we keep the selfish behavior of the prisioner's dilemma).
Plots of global trust for async and sync, small-world (watts-strogatz) networks
Added code for extracting global fitness. It also plots global trust and global fitness in one figure.
Modified version of optimal fitness for nodes to rewire.
async rewiring

drop weakest edge if under 1

probably create new edge with fittest node
plot subroutine with clustering coefficient & APL
rewire sync, rewire only if dropped edge
Merge pull request #1 from CA-Lab/master

gran pull antes de mudar de csbig para ca-lab