Shortest (directed or undirected) paths between vertices

path.length.hist() was renamed to distance_table() to create a more consistent API.

Usage

path.length.hist(graph, directed = TRUE)

Arguments

graph

The graph to work on.

directed

Whether to consider directed paths in directed graphs, this argument is ignored for undirected graphs.

Related documentation in the C library

path_length_hist()