choose all that are true for graphs. a. a simple graph does not have parallel edges or self-loops. b. in a connected, directed graph, every node is reachable from all other nodes. c. there cannot be any cycle in a tree. d. if a graph g is a forest, then there is no cycle in g.

### Leave a Comment

You must be logged in to post a comment.

following are the statementswhich are true to the following:parallel edgesor self-loops.hence truehence truehence truehence trueGraphshere: