Search:

So you mean in main it be:
for each index
for each adjacent vertex to current vertex @ graph[i].begin

also, begin refers to the head pointer, right, and NOT the first node (since it's an array...

I'm stuck on how the Depth first search outputs vertex 7, 9 for the given example using adjaceny lists:
The square brackets b/c it's an array of linked lists (so all adjacent nodes withing a given...