Example: confidence

Notes on Strongly Connected Components

Figure 1: The strongly connected components of a directed graph. 1 The Algorithm Goal ofLecture: to give a linear-time (i.e., O(m+n)-time) algorithm that computes the strongly connected components of a directed graph. The algorithm we present is essentially two passes of depth-first search, plus some extremely clever additional book-keeping.

Tags:

  Strongly

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries