I\'m trying to create a dijkstra-based function to return the furthest nodes within a given cutoff value for a node in G. I have a working search-algorithm which returns a d
