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:
https://git.skewed.de/count0/graph-tool/blob/master/src/ graph/topology/graph_kcore.hh
https://git.skewed.de/count0/graph-tool/blob/master/src/ graph/topology/graph_kcore.cc
I have written some simple documentation to explain how to add simple extensions, and
I will be adding it to the main documentation soon.
Best,
Tiago
PS. If you want Edmonds algorithm implemented in graph-tool, the most useful
work is to change the code in http://edmonds-alg.sourceforge.net/ 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 <tiago@skewed.de>
_______________________________________________
graph-tool mailing list
graph-tool@skewed.de
https://lists.skewed.de/mailman/listinfo/graph-tool