Calculate Path Length

[mitemijalkov]

Using the distance function, calculate path length of each node.

Path length can be calculated for BU and WU graph. For BD and WD graphs, calculate In and Out - path length for all nodes.

For binary graphs, path length is based on the number of edges needing to reach one node starting from the other. For weighted graphs, the calculation is based on the weights of the edges (Dijkstra's algorithm). Since we have distance based on the number of edges, maybe this variant can be implemented for weighted graphs also.

[egolol]

Talking with Giovanni, we are going to change the settings rule to choose the mean to this class.
I have been testing and "length(nonzeros(Du~=Inf)); " does not give the desired number. That was how old Braph calculated it. new way is "length(Du(Du~=Inf & Du~=0));"