# Chapter 22 Elementary Graph Algorithms

## 1 Representations of graphs

### 22.1-1

$O(V+E)$, $O(V+E)$.

### 22.1-2

1 - 2, 3
2 - 1, 4, 5
3 - 1, 6, 7
4 - 2
5 - 2
6 - 3
7 - 3


### 22.1-3

let Adj'[1..|G.V|] be a new adjacency list of transposed G
for each vertex u ∈ G.V
for each vertex v ∈ G.Adj[u]


### 22.1-4

If we have a graph represented in adjacency-list form, transpose it, and the adjacency-list for each vertex is ordered. Transpose the transposed graph again, we’ll get the original graph but with adjacency-list for each vertex sorted. Merge the adjacency-lists of both “ordered” graphs at every vertex into new adjacency-lists, then the graph represented by these adjacency-lists is the desired undirected graph.

TO_UNDIRECTED(G)
let G^T = TRANSPOSED(G)
let G = TRANSPOSED(G^T)
let G_new be a new undirected equivalent graph to G
for each vertex u in G.V
return G_new

MERGE(List_1, List_2, ex)
merge ordered lists List_1 and List_2 (with element ex excluded)
into a single list and return it


### 22.1-5

SQUARE(G)
let G^2 be a new graph
let E be a new hash set of edges of of G^2
for each vertex u ∈ G.V
for each vertex v ∈ G.V[u]
for each vertex w ∈ G.V[v]
INSERT(E, edge (u, w))
for each edge e in E
return G^2


For adjacency-matrix representation, square the matrix and replace all non-zero elements with one.

The running time for both algorithms is $O(V^3)$.

### 22.1-6

Denote the value of the $i$-th row and $j$-th column as $a_{i,j}$. Then if vertex $k$ is a universal sink, the graph must have the $k$-th row filled with $0$ and the $k$-th column filled with $1$ except for the $k$-th row.

We could find the universal as follows: Start from $a_{1,1}$. If the current entry $a_{i,j}$ is $0$, we let $j=j+1$ (move to the next column); otherwise $a_{i,j}$ is $1$, we let $i=i+1$ (move to the next row). Do this repeatedly until $j$ reaches $|V|$. Check if the final $j$ is a universal sink; if not, this means $G$ doesn’t contain a universal sink.

The running time is $O(V)$.

### 22.1-7

Let $M=BB^{\rm T}$, then $M_{i,j}=\sum_{k=0}^{|E|}B_{i,k}B_{j,k}$. There are two types of values:

1. if $i=j$, then $B_{i,k}B_{j,k}=1$ if edge $k$ leaves or enters vertex $i$;
2. otherwise $i\neq j$, then $B_{i,k}B_{j,k}=-1$ if and only if edge $k$ connects vertex $i$ and $j$.

So, when summed up,

$$M_{i,j}=\begin{cases}\text{degree of vertex i}&\text{if i=j,}\\-(\text{number of edges connecting i and j})&\text{if i\neq j.}\end{cases}$$

### 22.1-8

The expected time is $O(1)$, the same as a hash table lookup. The disadvantage of using hash-tables is they take up more space than list.

We can use binary search trees to store lists of adjacent vertices; they takes up the same amount of spaces as lists, but the time complexity for both inserting a new vertex and for lookups is $O(\log V)$ instead of $O(1)$.

### 22.2-1

$\text{vertex}$$1$$2$$3$$4$$5$$6$
$d$$\infty$$3$$0$$2$$1$$1$
$\pi$$\small{\text{NIL}}$$4$$\small{\text{NIL}}$$5$$3$$3$

### 22.2-3

The book introduced gray to distinguish between enqueued and dequeued vertices. In fact, black and gray vertices have the same property, so it suffices to use just two colors, black and white.

### 22.2-4

The running time for iterating all edges is $O(V^2)$, and $\Theta(V)$ queue operations are required. Therefore, the total running time is $O(V^2)$.

### 22.2-5

Theorem 22.5 tells that upon termination of BFS on a graph $G$, we have $v.d=\delta(s,d)$ for any $s\in G.V$. This is an underlying property of the graph, no matter how we represent the graph.

### 22.2-6

For example, for the directed graph $G=(V,E)$

a->b<-c


we have $E_\pi=E$. Clearly the set of edges $E_\pi$ cannot be obtained by running a BFS on it.

### 22.2-7

COLOR(G)
for each vertex u ∈ G.V
u.color = NONE
for each vertex s ∈ G.V
if s.color == NONE
COLOR_FROM_SOURCE(G, s)

COLOR_FROM_SOURCE(G, s)
s.color = WHITE
Q = ∅
ENQUEUE(Q, s)
while Q != ∅
u = DEQUEUE(Q)
for each vertex v ∈ G.Adj[u]
if v.color == NONE
v.color = OPPOSITE_COLOR(u.color)
ENQUEUE(Q, v)
else if v.color == u.color
print "unable to designate"

OPPOSITE_COLOR(color)
return white if color is black and vice versa


Represent wrestlers as vertices and the existence of a rivalry as an undirected edge between two vertices. Thus, producing a graph $G=(V,E)$. After running the procedure COLOR on $G$, we will have the “color” of each wrestler as his property if it’s possible to designate, otherwise we will have “unable to designate” displayed on the screen.

TODO