How to count vertices (or edges) using `anytree`?

Asked May 27 '22 at 08:18

Active May 27 '22 at 11:01

Viewed 77 times

I would like to determine the size of a tree by number of vertices.

Clearly,

len(list(PreOrderIter(root)))

gives me this number.

Is this the way to do it?

In other words, is there a recommended dedicated function or something for this in anytree?

Can the above be possibly more efficient somehow?

edited May 27 '22 at 11:01

asked May 27 '22 at 08:18

Bálint Sass

`num_of_edges = num_of_vertices - 1` in a tree, so the two are essentially the same. – Bálint Sass May 27 '22 at 08:45
1

In any case `sum(1 for _ in iter)` is more memory-efficient than `len(list(iter))`. I don't know if it's faster. – mkrieger1 May 27 '22 at 09:06

0 Answers0