1 The subgraph consists of all first-and second-degree neighbors of the target word.
to keep the size of the subgraph manageable, we increment the edge weight threshold as we move away from the target word.