the researchers could quickly find shortest paths through every part of the graph. For the tight clusters at the innermost level of the nested graph structure, this was easy — they had practically no ...