Description: All the shortest path in a network is obtained, the dielectric number of all the nodes and edges and was determined according to the shortest path. Applicable to a directed graph and no directed graph.
To Search:
File list (Check if you may need any files):
betweenness.m
Download