6.4.26 Graph theory

Problem: A digraph is defined by an adjacency matrix. It is necessary to: a) draw a graph; b) identify components of strong connectivity; c) replace all arcs with edges and find an Euler chain (or cycle) in the obtained undirected graph. \[ \left(\begin{array}{llllll} 0 & 0 & 0 & 0 & 1 & 1 \\ 0 & 0 & 0 & 0 & 1 & 0 \\ 1 & 1 & 1 & 0 & 0 & 0 \\ 1 & 0 & 1 & 0 & 0 & 1 \\ 0 & 1 & 0 & 0 & 0 & 0 \\ 1 & 0 & 1 & 1 & 1 & 0 \end{array}\right) \]