Does anyone know if the Java Jung2 graph library provides the in-built capability to traverse a Digraph given a start Vector? I did see that there's a BFSDistanceLabeler class that returns a map of distances, which could do, but I then need to sort the values (highest distance first) and iterate through the sorted set.
I'm creating a dependency management facility for Javascript using Maven and so I was thinking about using Jung2 to maintain my dependency graph.