Sounds good. Thanks!

On Wed, Sep 20, 2017 at 11:26 PM, Tiago de Paula Peixoto <> wrote:
On 20.09.2017 20:49, 肖晗 wrote:
> Can I circumvent the graph copying procedure?

You have to use the C++ representation of the graph that is used internally
by graph-tool, but this is not documented. You have to look in source code,
e.g. as is done for k-core:

I have written some simple documentation to explain how to add simple extensions, and
I will be adding it to the main documentation soon.


PS. If you want Edmonds algorithm implemented in graph-tool, the most useful
work is to change the code in so that it
works for the sparse case. The dense algorithm used there is too slow for
big networks, but it can be changed by using priority queues.

Tiago de Paula Peixoto <>
graph-tool mailing list