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
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?
Yes, it is, and I should put this in the documentation somewhere.
> I know that graph-tool is built upon C++ and Boost, and the adjacency
>
Many thanks Tiago for the quick answer.
I've tried (using `htop` command) to measure the RES memory requirement for
such a graph with 1M nodes and 100M links, but the results is almost twice
the size, a total of 6.2 GB.
Is there a reason why I get that figure?
I am on MacOS 10.15.6 Catalina
Il
Am 06.07.20 um 15:53 schrieb Carlo Nicolini:
> Many thanks Tiago for the quick answer.
>
> I've tried (using `htop` command) to measure the RES memory requirement
> for such a graph with 1M nodes and 100M links, but the results is almost
> twice the size, a total of 6.2 GB.
> Is there a reason why
Greetings everyone, I just began to check this awesome module for Graphs in
Python and I'm interested in Flow algorithms, specifically the Minimum S-T
cut one, however I don't know if the example for the final two algorithms:
"graph_tool.flow.min_st_cut" and "graph_tool.flow.min_cut" is missing or
Am 06.07.20 um 21:20 schrieb spolo96:
> Greetings everyone, I just began to check this awesome module for Graphs in
> Python and I'm interested in Flow algorithms, specifically the Minimum S-T
> cut one, however I don't know if the example for the final two algorithms:
> "graph_tool.flow.min_st_cut
Hello Tiago! First of all thanks for the very fast response! I highly
appreciate it.
I tried to go the website in order to create an issue but it appears that I
cannot post an issue/have access to it.
It may be related to the specific website permission, so I hope that another
person who has acc
Am 06.07.20 um 21:46 schrieb spolo96:
> Hello Tiago! First of all thanks for the very fast response! I highly
> appreciate it.
>
> I tried to go the website in order to create an issue but it appears that I
> cannot post an issue/have access to it.
>
> It may be related to the specific website p
