(Solved): The following graph is the result of the forward step starting from node A when we calculate edge be ...

The following graph is the result of the forward step starting from node A when we calculate edge betweenness. Node values denote the number of shortest paths starting from node A.

1. what is the node flow of G?
2. what’s the edge ow of (G, I)?
3. In order to get the edge betweenness we need to…, which is true?(a)we need to add all the edge ows shown in this graph. (b)we need to add all the edge ows computed with dierent starting nodes. (c)we need to add all the edge ows shown in this graph. (d)we need to add all the edge ows computed with dierent starting nodes.