newGraph(V): | Input number of nodes V | Output new empty graph | | g.nV = V // #vertices (numbered 0..V-1) | g.nE = 0 // #edges | allocate memory for g.edges[] | for all i=0..V-1 do | g.edges[i]=NULL // empty list | end for | return g