IMPLICIT GRAPH DOUBT

I DIDNT GET WHAT EXACTLY IS IMPLICIT GRAPH

@tusharkhandelwal315,
It just means that the edges have a logic, and thus can be calculated impromptu, rather than being have to stored in memory. For e.g, If I say consider a graph of n vertices {0,1,2,…n}, s.t there is an edge between vertices of same parity, then you would not have to store this graph in memory, rather, for checking whether an edge exists between two vertices, you will just check there parity.