[Maximum mark: 4]
.png?alt=media&token=07d896e2-8a60-4732-a826-399a44fcadc8)
- [2]
State with reason whether the graph above is strongly connected.
- [2]
Hence, find the number of paths of length 5 starting at D and ending at A.
State with reason whether the graph above is strongly connected.
Hence, find the number of paths of length 5 starting at D and ending at A.
State with reason whether the graph above is strongly connected.
Hence, find the number of paths of length 5 starting at D and ending at A.