top of page
  • Jesse Sakari Hyttinen

BFG in action! - Jesse Hyttinen

Updated: Apr 20, 2021


In tree enumeration, we usually use the algorithms BFG and BFG --> TGA in cooperation; In the rooted tree case, we only need to use one of these. This is due to the fact that there are actually no restrictive conditions in the forests of rooted trees.

Here is an example of the case v = 10:





In other words, r10 = 719. In the next post I will show how the values r1-r9 are enumerated with the BFG, and will also show how the procedure of the case v = 10 is done with the algorithm BFG --> TGA.

6 views0 comments

Recent Posts

See All

Skill levels in Treespeak

Examples of Treespeak times, index +1 Novice: Tsm 0-11 --- t >= 10s / rooted tree Apprentice: Tsm 0-11 --- t € [7s ; 10s[ / rooted tree Journeyman: Tsm 0-11 --- t € [5s ; 7s[ / rooted tree Adept: Ts

A new book - Jesse Hyttinen

I have now written five math books, and may write another one in the following year. The current book includes new viewpoints about very well known numbers. Examples include pi and Euler's number. The

Generating r9 part 2 - Jesse Hyttinen

Hi and welcome to the Matladpi blog! We continue the generation process in the column 7: =1+7+1 =1+(1+2+1*4)+1 =1+(1+2*2+1*2)+1 =1+(1+2*3)+1 =1+(1+3+1*3)+1 =1+(1+(1+2)+1*3)+1 =1+(1+3+2+1)+1 =1+(1+(1+2

Post: Blog2_Post
bottom of page