shortest_distances: Calculate shortest distances of unweighted graph
In wulingyun/BlockSim: Blockchain simulation and research tools

Description Usage Arguments Details Value

Calculate all pairs of shortest distances of unweighted graph

shortest_distances(
  adj_matrix,
  source_nodes = rep_len(TRUE, dim(adj_matrix)[1])
)

`adj_matrix`	Logical adjacency matrix of given unweighted graph
`source_nodes`	Logical vector to indicate the source nodes that need to calculate the shortest distances

This function calculates all pairs of shortest distances of unweighted graph by using breadth-first-search (BFS) algorithm.

This function will return the shortest distance matrix, where the element [i, j] is the shortest distance between node i and j. Value Inf means unreachable. If source_nodes[i] equals FALSE, the shortest distance from i to other nodes will not be calculated and the row i will be all Inf.

wulingyun/BlockSim documentation built on Dec. 4, 2019, 1:54 a.m.