bool adjacent(Graph g, Vertex x, Vertex y) { assert(g != NULL && validV(g,x)); return inLL(g->edges[x], y); }
inLL() checks if linked list contains an element
inLL()