Editing Strongly connected component (section)

===Generating random strongly connected graphs===

Peter M. Maurer describes an algorithm for generating random strongly connected graphs,<ref>{{Citation|author=Maurer, P. M.|title=Generating strongly connected random graphs|publisher=CSREA Press|isbn=978-1-60132-465-8|series=Int'l Conf. Modeling, Sim. and Vis. Methods MSV'17|date=February 2018 |access-date=December 27, 2019|url=https://csce.ucmss.com/cr/books/2017/LFS/CSREA2017/MSV3359.pdf}}</ref> based on a modification of an algorithm for [[strong connectivity augmentation]], the problem of adding as few edges as possible to make a graph strongly connected.  When used in conjunction with the Gilbert or Erdős-Rényi models with node relabelling, the algorithm is capable of generating any strongly connected graph on ''n'' nodes, without restriction on the kinds of structures that can be generated.