The G=(V,E) is a network graphic, and V is the vertex set, and E is the edge set. V=(u,v,w,x,y,z), and E=((u,v),(u,w),(u,x),(v,w),(v,x),(w,x),(w,y),(w,z),(x,y),(y,z)).
What is the shortest path from u to z? (for example the path u->x->w is uxw)