In the first chapter, we defined what ‘connected’ and ‘strongly connected’ means; we also introduced the notion of k-connectivity in Chapter 7. The Algorithm of Moore (BFS) we presented in Chapter 3 is an efficient method for determining the connected components of a graph. Now, in the present chapter, we mainly treat algorithmic questions concerning k-connectivity and strong connectivity for directed graphs. We develop a further strategy for searching (besides BFS), namely ‘Depth First Search’. This chapter also contains various theoretical results, for example characterizations of 2-connected graphs and of edge connectivity.
KeywordsDirected Graph Connected Graph Directed Path Edge Incident Strong Component
Unable to display preview. Download preview PDF.