- a) what is the reciprocity degree of this network? - b) List all the strongly connected components (SCC) on this network. c) For each one of those SCC, list their out-component and their in-component - d) Pick one node at random (the one you prefer, but not one of degree 1 since that is too easy) and list the geodesic distance between the node you chose and each one of the other nodes in the network. In the case of the undirected network you will get one number per each distance; in the case of the directed network you might get two different numbers: the distance from your node to someone, and the distance from that someone to your node. Present the results in a table and compare. i) If there is no arrow between any two nodes, there will still be no connection between those nodes. ii) if there is just one arrow between two nodes, there will an undirected link of strength 1 between them iii) if there are two arrows between any two nodes, there will be an undirected link of strength 2 between those two nodes. In this new WEIGHTED but undirected network calculate again the shortest distance between the node you picked before and all the other nodes, and compare with the previous result. Remember that the length of a path is now not just the number of links along it, but the sum of all the weights of those links, so if you are separated from someone by three links of strength one, that is a shorter distance than being separated from him by two links each of which has strength two