Scribd
Upload
18 views

03b Graphs

Breadth-first search (BFS) and depth-first search (DFS) are graph search algorithms that can be used to traverse directed graphs. BFS gives distances from the root node while DFS explores nodes in depth-first manner. A graph is strongly connected if every node is mutually reachable via paths in both directions from every other node. Strong connectivity can be tested in linear time by running BFS on the original graph and its reverse.

Uploaded by

ap6487
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

03b Graphs

Breadth-first search (BFS) and depth-first search (DFS) are graph search algorithms that can be used to traverse directed graphs. BFS gives distances from the root node while DFS explores nodes in depth-first manner. A graph is strongly connected if every node is mutually reachable via paths in both directions from every other node. Strong connectivity can be tested in linear time by running BFS on the original graph and its reverse.

Uploaded by

ap6487
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Recap of graph searching

Breadth First Search

• BFS gives distances from the root (layers).


§ With respect to the BFS tree, the edges of the graph could either
be forward edges (edges of the BFS tree) or cross edges (edges s.t.
none of their endpoints is a predecessor of the other in the BFS
tree).
§ No backward edges.
§ A cross edge tree may jump at most one layer.
§ If the order that the children of a node are examined changes, then
the layers remain the same, but some forward edges may become
cross and vice versa.

1
Graph searching recap II

Depth First Seach

§ In DFS search, after each choice of a node the search proceeds


trying to go “in depth.”
§ With respect to the DFS tree, the edges of the graph could either
be forward edges (edges of the tree) or backward edges (edges
not belonging to the tree and s.t. at least one of the endpoints is a
predecessor of the other in the tree).
§ No cross edges.
§ A backward edge may connect nodes any number of layers apart.
§ If the order that the children of a node are examined changes, the
tree may change dramatically.
§ If the BFS and the DFS trees coincide, the graph is the common
tree.

2
Bipartite Graphs

Def. An undirected graph G = (V, E) is bipartite if the nodes can be


colored red or blue such that every edge has one red and one blue end.

Applications.
■Scheduling: machines = red, jobs = blue.
■Matching.

a bipartite graph

3
Testing Bipartiteness

Testing bipartiteness. Given a graph G, is it bipartite?


■ Many graph problems become:
– easier if the underlying graph is bipartite (matching)
– tractable if the underlying graph is bipartite (independent set)
■ Before attempting to design an algorithm, we need to understand
structure of bipartite graphs.

v2
v2 v3
v1
v4

v6 v5 v4 v3
v5
v6
v7 v1
v7

a bipartite graph G another drawing of G

4
An Obstruction to Bipartiteness

Lemma. If a graph G is bipartite, it cannot contain an odd length cycle.

Pf. Not possible to 2-color the odd cycle, let alone G.

bipartite not bipartite


(2-colorable) (not 2-colorable)

5
Bipartite Graphs

Lemma. Let G be a connected graph, and let L0, …, Lk be the layers


produced by BFS starting at node s. Exactly one of the following holds.
(i) If no edge of G joins two nodes of the same layer, then G is
bipartite.
(ii) If an edge of G joins two nodes of the same layer, then G contains
an odd-length cycle (and hence is not bipartite).

L1 L2 L3 L1 L2 L3

(i) (ii)
6
Bipartite Graphs

Lemma. Let G be a connected graph, and let L0, …, Lk be the layers


produced by BFS starting at node s. Exactly one of the following holds.
(i) If no edge of G joins two nodes of the same layer, then G is
bipartite.
(ii) If an edge of G joins two nodes of the same layer, then G contains
an odd-length cycle (and hence is not bipartite).
Pf. (i)
■ Suppose no edge joins two nodes in the same layer.
■ By recap, this implies all edges join nodes on successive levels.
■ Bipartition: red = nodes on odd levels, blue = nodes on even levels.

L1 L2 L3

7
Bipartite Graphs

Lemma. Let G be a connected graph, and let L0, …, Lk be the layers


produced by BFS starting at node s. Exactly one of the following holds.
(i) If no edge of G joins two nodes of the same layer, then G is
bipartite.
(ii) If an edge of G joins two nodes of the same layer, then G contains
an odd-length cycle (and hence is not bipartite).

Pf. (ii)
■ Suppose (x, y) is an edge with x, y in same level Lj. z = lca(x, y)
■ Let z = lca(x, y) = lowest common ancestor.
■ Let Li be level containing z.
■ Consider cycle that takes edge from x to y,
then path from y to z, then path from z to x.
■ Its length is 1 + (j-i) + (j-i), which is odd. ▪
(x, y) path from path from
y to z z to x

8
Obstruction to Bipartiteness

Corollary. A graph G is bipartite iff it contains no odd length cycle.

5-cycle C

bipartite not bipartite


(2-colorable) (not 2-colorable)

9
Connectivity in Directed Graphs
Directed Graphs

Directed graph. G = (V, E)


■ Edge (u, v) goes from node u to node v.

Ex. Web graph - hyperlink points from one web page to another.
■ Directedness of graph is crucial.
■ Modern web search engines exploit hyperlink structure to rank web
pages by importance.

11
Graph Search

Directed reachability. Given a node s, find all nodes reachable from s.

Directed s-t shortest path problem. Given two node s and t, what is
the length of the shortest path between s and t?

Graph search. BFS extends naturally to directed graphs.

But only to find distances from s. Or to check reachability from s.


Not to search all elements of the graph.
§ Impasse: Start from a sink.
§ Wherever you start you are not going to get to a source different
from where you started.
Web crawler. Start from web page s. Find all web pages linked from s,
either directly or indirectly.

12
Strong Connectivity

Def. Node u and v are mutually reachable if there is a path from u to v


and also a path from v to u.

Def. A graph is strongly connected if every pair of nodes is mutually


reachable.

Lemma. Let s be any node. G is strongly connected iff every node is


reachable from s, and s is reachable from every node.

Pf. Þ Follows from definition.


Pf. Ü Path from u to v: concatenate u-s path with s-v path.
Path from v to u: concatenate v-s path with s-u path. ▪

ok if paths overlap

s u

13
Strong Connectivity: Algorithm

Theorem. Can determine if G is strongly connected in O(m + n) time.


Pf.
■ Pick any node s.
■ Run BFS from s in G. reverse orientation of every edge in G

■ Run BFS from s in Grev.


■ Return true iff all nodes reached in both BFS executions.
■ Correctness follows immediately from previous lemma. ▪

strongly connected not strongly connected

14

You might also like