Joshua O'Madadhain

I'm willing to consider this, but IMO, it's something we can address after 3.0 is released. I'm more interested in adapting our tests to use Truth for most things, honestly....

@jbduncan JUNG is used by Google internally, and I can look there (since I work there :) ). However, I'm going to need to migrate the JUNG 2.x code to...

@jbduncan To answer your question, I have not sought out further usage data. Currently `Layout.getGraph()` does not exist, and the visualization architecture has been refactored so that the `VisualizationModel` holds...

@darkclouder thanks for the report. I would imagine that a betweenness of 0 for anything that isn't an isolated node would be a bug, yeah (unless the edge lengths themselves...

Glad you've found JUNG useful. :) Which you should use depends on what's important to you, and I don't know enough about your needs (for example, which parts of the...

@jbduncan I'm going to assume you've got this one; LMK if you need anything from me. (And thanks to both of you for continuing to follow up and get this...

Merging the classes together is almost certainly the right thing to do. The one caveat is that we don't want to cause people who only care about distances to incur...

That discussion has been on the back burner for a while, mostly because it got blocked on a related issue that got blocked on basically coming up with definitions for...

related: #80 (proposal to allow the size of the cache to be limited)

bringing in comment from elsewhere: > I liked your idea about sharing the common shortest paths, but I also think you can get significant mileage out of reusing edges (or...