Complete graph checking
<p>How can I check for a complete graph (that is,each node is connected to each other nodes) in an efficient way? The given graph is undirected and non-weighted.</p>

<p>I have used BFS to check but it's not efficient way to check for all nodes,</p>

<pre><code>1 &lt;= number of nodes &lt;= 10^4
</code></pre>

<p>Is there any other approach which help me to this task?</p>