| a. connection of nodes without containing any cycle |
| b. connecting nodes to make at least three complete cycles |
| c. start node and end node in a graph are same having a cycle |
| d. connection of every node with every other node including itself in a digraph |
| Answer: connection of every node with every other node including itself in a digraph |