Il giorno lun 6 lug 2020 alle ore 14:41 Tiago de Paula Peixoto <
ti...@skewed.de> ha scritto:
> Am 06.07.20 um 13:00 schrieb Carlo Nicolini:
> > Dear Tiago,
> >
> > How is it possible to get an estimate for the memory requirement of a
> > graph in graph-tool?
&g
Dear Tiago,
How is it possible to get an estimate for the memory requirement of a graph
in graph-tool?
I know that graph-tool is built upon C++ and Boost, and the adjacency list
is stored via a hash-map.
Apart from the cost of storing the values of vertices indices and edges
indices as `unsigned l
I have a graph in graph-tool with parallel edges. All parallel edges are
assigned an `EdgePropertyMap` representing their weight with a double. I
would like to return a graph where the edges are condensed into a single
edge where a custom reduce operation on these weights is performed. For
example:
