Recitation 13: Relations and Directed Graphs

Part 1: Relations

Part 2: Directed Graphs

\begin{bmatrix} 1 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 1 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 1 & 0 & 1 & 0 & 1 \\ 0 & 0 & 0 & 1 & 0 & 0 \\ 1 & 1 & 0 & 1 & 1 & 1 \end{bmatrix}

The code for this graph is:

digraph G {
    a -> b
    b -> c
    b -> e
    e -> f
    f -> a
    c -> d
    c -> g
    e -> g
    e -> h
    f -> h
}