Joshua O'Madadhain

CONSTANT VIGILANCE! (channelling Mad-Eye Moody :) ) I am open to reconsidering the semantics of `MutableCTree.putEdge()`, but there are reasons the way that is as it is. Currently... (1) ...it's...

We can edit that to "first node added to an _empty_ tree". :) I'm not actually advocating for disallowing removing the root from a tree; if nothing else, that, too,...

Thanks for your suggested fix. It turns out that there was an additional fix needed, which I supplied in #263, so this patch is no longer needed, but I appreciate...

It's a reasonable question. MapBinaryHeap, however, is a specialized data structure that (as the name implies) combines two different data structures so as to enable operations that aren't part of...

It's an internal implementation detail IIRC--that is, MBH itself isn't a part of our APIs, although I think it's a public class--so we can certainly swap our our implementation if...

@atulgirishkumar Sorry for the delay in response. Work was kind of crazy at the time that you posted your question. :) JUNG 3.0 has not yet been released, but the...

I don't particularly consider JUNG to be an extension to common.graph, but a client of it, but that's a minor issue. I agree that their style and practices are generally...

So, funny story about `BinaryTreeTraverser`: while we were looking into incorporating the Traverser stuff into common.graph, I recently established that ~no one uses BTT either internally or externally, and so...

Only ~2 years later (sorry about that)...yes, I think your suggestion of moving those specific methods to `MoreGraphs` is reasonable. That said, a related issue we may want to tackle...

I agree that while it may be useful to think about how binary/k-ary trees would fit into the type system, we probably don't need to actually write code to support...