Hello, there is a library for Python called networkx, and it has an interesting functionality I couldn't find in jgrapht, which is the possibility of calculating all reachable vertexes from given vertex and with a distance smaller than a threshold (see example here).