Complement graph

#1

How to convert the graph to a complement graph efficiently?

#2

Simply when you get an edge from u to v, make another graph with edge v to u.
You will never find a constraint that you can’t make another graph. It’s never a problem

#3

What you are saying is for reversing a graph.

#4

Can you please clear my doubt. I know how to reverse a graph. I want to find complement of a graph efficiently.efficiently.

#5

Okay okay i am sorry.
For complement, i think you can do it in bruteforce O(n^2) time only.
Just iterating over entire Adj. matrix.