Subgraphs

A subgraph S of a graph
G is a graph such that
Depth-First Search „ The vertices of S are a
subset of the vertices of G
„ The edges of S are a Subgraph
A
subset of the edges of G
A spanning subgraph of G
B D E
is a subgraph that
contains all the vertices
C
of G

Spanning subgraph

© 2004 Goodrich, Tamassia Depth-First Search 1 © 2004 Goodrich, Tamassia Depth-First Search 2

Connectivity Trees and Forests

A (free) tree is an
A graph is undirected graph T such
connected if there is that
a path between „ T is connected
every pair of Connected graph „ T has no cycles Tree
This definition of tree is
vertices different from the one of
A connected a rooted tree
component of a A forest is an undirected
graph G is a graph without cycles
maximal connected The connected
subgraph of G Non connected graph with two components of a forest
connected components are trees Forest

© 2004 Goodrich, Tamassia Depth-First Search 3 © 2004 Goodrich, Tamassia Depth-First Search 4
 Spanning Trees and Forests
A spanning tree of a
connected graph is a
spanning subgraph that is
a tree
A spanning tree is not
unique unless the graph is
a tree
Spanning trees have
applications to the design
of communication
networks
A spanning forest of a
graph is a spanning
subgraph that is a forest
© 2004 Goodrich, Tamassia Depth-First Search
DFS Algorithm
The algorithm uses a mechanism
for setting and getting “labels” of
vertices and edges
Algorithm DFS(G)
Input graph G
Output labeling of the edges of G
as discovery edges and
back edges
for all u ∈ G.vertices()
setLabel(u, UNEXPLORED)
for all e ∈ G.edges()
setLabel(e, UNEXPLORED)
for all v ∈ G.vertices()
if getLabel(v) = UNEXPLORED
DFS(G, v)
© 2004 Goodrich, Tamassia Depth-First Search
Depth-First Search (§ 12.3.1)
Depth- first search (DFS) DFS on a graph with n
is a general technique vertices and m edges
for traversing a graph takes O(n + m ) time
A DFS traversal of a DFS can be further
graph G extended to solve other
Graph „ Visits all the vertices and graph problems
edges of G „ Find and report a path
„ Determines whether G is between two given
connected vertices
„ Computes the connected „ Find a cycle in the graph
components of G Depth- first search is to
Computes a spanning
„
graphs what Euler tour
forest of G
is to binary trees
Spanning tree
5 © 2004 Goodrich, Tamassia Depth-First Search 6
Example
A
A unexplored vertex
Algorithm DFS(G, v)
Input graph G and a start vertex v of G
A visited vertex
B D E
Output labeling of the edges of G unexplored edge
in the connected component of v
as discovery edges and back edges discovery edge C
setLabel(v, VISITED) back edge
for all e ∈ G.incidentEdges(v)
if getLabel(e) = UNEXPLORED
w ← opposite(v,e) A A
if getLabel(w) = UNEXPLORED
setLabel(e, DISCOVERY)
B D E B D E
DFS(G, w)
else
setLabel(e, BACK) C C
7 © 2004 Goodrich, Tamassia Depth-First Search 8
 Example (cont.) DFS and Maze Traversal
A A The DFS algorithm is
similar to a classic
B D E B D E strategy for exploring
a maze
C C „ We mark each
intersection, corner
and dead end (vertex)
visited
„ We mark each corridor
A A
(edge ) traversed
„ We keep track of the
B D E B D E path back to the
entrance (start vertex)
by means of a rope
C C (recursion stack)
© 2004 Goodrich, Tamassia Depth-First Search 9 © 2004 Goodrich, Tamassia Depth-First Search 10

Properties of DFS Analysis of DFS

Property 1 Setting/getting a vertex/edge label takes O(1) time
DFS(G, v) visits all the Each vertex is labeled twice
vertices and edges in „ once as UNEXPLORED
the connected A „ once as VISITED
component of v Each edge is labeled twice
once as UNEXPLORED
Property 2 B D E
„

„ once as DISCOVERY or BACK

The discovery edges
Method incidentEdges is called once for each vertex
labeled by DFS(G, v)
form a spanning tree of C DFS runs in O(n + m) time provided the graph is
the connected represented by the adjacency list structure
component of v „ Recall that Σv deg(v) = 2m

© 2004 Goodrich, Tamassia Depth-First Search 11 © 2004 Goodrich, Tamassia Depth-First Search 12
 Path Finding
We can specialize the DFS
algorithm to find a path
between two given
vertices u and z using the
template method pattern
We call DFS(G, u) with u
as the start vertex
We use a stack S to keep
track of the path between
the start vertex and the
current vertex
As soon as destination
vertex z is encountered,
we return the path as the
contents of the stack
© 2004 Goodrich, Tamassia Depth-First Search
Algorithm pathDFS(G, v, z)
setLabel(v, VISITED)
S.push(v)
if v = z
return S.elements()
for all e ∈ G.incidentEdges(v)
if getLabel(e) = UNEXPLORED
w ← opposite(v,e)
if getLabel(w) = UNEXPLORED
setLabel(e, DISCOVERY)
S.push(e)
pathDFS(G, w, z)
S.pop(e)
else
setLabel(e, BACK)
S.pop(v)
13
Cycle Finding
We can specialize the
Algorithm cycleDFS(G, v, z)
setLabel(v, VISITED)
DFS algorithm to find a S.push(v)
simple cycle using the for all e ∈ G.incidentEdges(v)
template method pattern if getLabel(e) = UNEXPLORED
w ← opposite(v,e)
We use a stack S to
S.push(e)
keep track of the path if getLabel(w) = UNEXPLORED
setLabel(e, DISCOVERY)
between the start vertex
pathDFS(G, w, z)
and the current vertex S.pop(e)
As soon as a back edge else
T ← new empty stack
(v, w) is encountered, repeat
we return the cycle as o ← S.pop()
the portion of the stack T.push(o)
until o = w
from the top to vertex w return T.elements()
S.pop(v)
© 2004 Goodrich, Tamassia Depth-First Search 14