Matlab routines for centrality in directed acyclic graphs

New Matlab functions for network centrality are introduced. Instead of the mean distance, the generalized mean distance is used. If closer relationships are prioritized, this closeness measure is also defined for unconnected graphs. Instead of distance to all nodes, distance to selected nodes is considered. Besides the vertical in- and out-closeness measures, horizontal cross-closeness is proposed.