Draw the directed graph that represents the relation {(a,a), (a, b), (b, c), (c, d), (a, d), (b, d), (d, b)}.
Let G = (V, E) be a directed graph that represents the given relation R, then there is that connects verticles if and only if pair . This graph is presented below
Comments
Leave a comment