Why we don"t involve the situation of j>k in the directed graph when we calculate the betweeness centrality? I can understand we ignore these situations in the undirected graph, because the result is double . In this directed graph, if we calculate E→C， the result will be different. I mean E does have an effect on C in the directed graph, which is not reflected in the paths we have already calculated, right?
Yes, from C to A should also be considered as they will be different paths. The same applies to DA, EA, DC, EC, ED also. However, in the example, all of these values (DA, EA, DC, EC, ED) will come out to be zero and will not affect the actual result. DA will not be included as there will be no path from D to A.
Simple and easy explanation.
Why we don"t involve the situation of j>k in the directed graph when we calculate the betweeness centrality? I can understand we ignore these situations in the undirected graph, because the result is double . In this directed graph, if we calculate E→C， the result will be different. I mean E does have an effect on C in the directed graph, which is not reflected in the paths we have already calculated, right?
in directed graph why we consider only A to C distance and not C to A?
Yes, from C to A should also be considered as they will be different paths. The same applies to DA, EA, DC, EC, ED also. However, in the example, all of these values (DA, EA, DC, EC, ED) will come out to be zero and will not affect the actual result. DA will not be included as there will be no path from D to A.
@@771aryanand there is no path from C to A so we have ignored 👍🏻
@@lakshsinghania bro j
How to find betweeness of 1000 nodes in undirected graph?? Please do reply for this
in 0/1, how will you get 1?
Very good explanatory video
Thank you
thanks! it helps a lot!
Thank you
Thanks :)
Made sense
cool