Question

A directed graph has three points in it. It has three nodes (A, B, C) and three edges such that there is an edge between A and B, A and C, B and C. You need to mark the
directions on the edges (ie, whether an edge leads from A to B or from B to A) such that the graph remains strongly connected. In how many unique ways can this be
accomplished?
(e.g, marking the edges as A to B. B to C, A to Cis one way of marking the direction of the edges - this may or may not be strongly connected though)
Pick ONE option​

Answer 1

Answer:

2

Explanation:

Answer 2

Explanation:

It has 3 nodes (A, B, C) and 3 edges such that there may be an aspect among A and B, A and C, B and C.

To mark the guidelines on the rims whether or not an aspect leads from A to B or from B to A such that the graph stays strongly linked.

One can mark it in three ways.

A graph is a graphical illustration of a hard and fast of items wherein a few pairs of items are linked via way of means hyperlinks.

It includes interconnected items which can be represented via way of means of factors termed as vertices, and the hyperlinks that join the vertices are known as edges.