Andrew Lumsdaine

Totally agree that we should do some benchmarking. On Apr 1, 2022, at 6:20 AM, KiterLuc ***@***.******@***.***>> wrote: A couple things. From a performance standpoint, this looks equivalent from a...

I apologize for completely missing your response on #160 back in June…. I can try to put in some example / testing code in the next couple of weeks or...

On Apr 10, 2023, at 7:47 AM, Robert Bindar ***@***.***> wrote: @robertbindar approved this pull request. This was a nice read, thanks a lot. It's not exactly clear to me...

The NWGraph matrix market reader is in [include/nwgraph/io/mmio.hpp .](https://github.com/pnnl/NWGraph/blob/master/include/nwgraph/io/mmio.hpp) Once we have an edge list concept (and one or more associated data structure(s), the reading is fairly straightforward and the...

Having an implicit graph is part of the "bring you own graph" functionality that we intend to have for std::graph. Boost.Graph has this capability (see the knight's tour problem in...

Let’s have a quick call and talk about our triangle counting implementation and the matrix-market reader we have in NWGraph. In a recent benchmarking paper against the other leading graph...

PS -- See the mmio functionality and build.hpp in NWGraph.

There are more aspects to triangle counting that we also need functionality for. Namely, the graph needs to be sorted by degree and relabeled and triangularized. The sorting + relabeling...