Josh Marshall
Josh Marshall
@jeremy-murphy Ping
Usually, you just have an acyclic graph, pick a vertex as your root, and use that as a tree. The reason why this usually isn't done with a full fat...
I don't think k-array trees are something which sound be added to the core of BGL. A constraint like that could be added, but it could just as well be...
Reading through the 2009 thread, it doesn't look like an imperative for inclusion was ever reached. I'm trying to think here, at what point does it make sense to change...
I do mean a traversal algorithm as a special case. One of my bigger areas of study has been AI, and this is one feature often worked around in my...
Update cross reference from the mailing list: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3700.html
@deinst Thanks!
I'm helping out with the PR backlog. Looks like you have a bugfix, incomplete tests, and no new examples will be needed. Please make your PR complete. This is to...
This may be tangled then. The PR needs to be clean and not affect other parts of the implementation. I'm going to hold off on messing with this until after...
There really shouldn't be unintended side effects. I'm not going to promote a PR that knowingly introduces regressions.