Using the above state transition mechanism, information from each node propagates to all its neighboring nodes after each step.
for the worst case where the input graph is a chain of nodes, the maximum number of steps necessary for information from one arbitrary node to reach another is equal to the size of the graph.