Does anyone know of a method to *estimate* the number of squares in a products factor tree?

Is prime factorising not fast enough?

@tbjgolden obviously it's not fast enough!

@catgirldev Recursion for BFS ? It is highly unnatural and would be very very suboptimal even if you code it up with a lot of logic. Recursion is meant for reaching the depths first. Unless you meant to say queue, which will give you optimal complexity.