For the rest of this section, we will mostly concern ourselves with inlinks (not the outlinks we were just talking about), and the process of constrained graph expansion when considering them. Ok, so now, let's find all the inlinks into all the pages in this graph in that first layer beyond the initial page. In this case there is a single page e2_1 that points in to e1_2, so it is an inlink for the e1_2 page. (The pages are just named to highlight how far they are from the initial page)