GeeksforGeeks » Interview Questions
datastructure
(3 posts)-
in directed graph there are 7 verteces and 25 edgs.the out going of 6 verteces are given what is outgoing of last vertex
v1 3
v2 2
v3 6
v4 1
v5 4
v6 5
v7 ? -
It should be 0.
@suresh Please correct me if I am wrong.
But for a graph with 7 vertices we can have a maximum of 7C2(combination) edges. So 7*3 = 21, which is already there. 21-(3+2+6+1+5+4) = 0 -
no this directed graph so there are n(n-) edges so total are 42 edges
Reply
You must log in to post.
