[igraph] community_fastgreedy algorithm in Python

[Martin Bachwerk]

Hello,

A short question considering the community_fastgreedy algorithm 
implementation in Python: why does it return a VertextClustering object? 
According to the paper you cited, "Finding community structure in very 
large networks", the result of the algorithm should be a dendrogram and 
the implementation in GraphBase at least returns a list of merges. Those 
can be helpful already, but would it be somehow possible to have a 
VertexDendrogram object returned from the Graph implementation of the 
algorithm?

Thanks in advance for your help!

Martin