show(g): | Input graph g | | for all i=0 to g.nV-2 do | | for all j=i+1 to g.nV-1 do | | if g.edges[i][j] then | | print i"—"j | | end if | | end for | end for
Time complexity: O(V2)