frob

C0lumbo is pretty much on track.  Process all messages that have arrived rather than just one, and look at your frequency of messages.

I have moved this question to the Networking forum where it belongs.  Check the Forum FAQ and the links it contains, especially Q12 and Q14.

For a a scene tree the best solution is to use recursion ?

Usually a world has multiple data structures involved.

A scene or level or world is usually going to be used for many frequent searches and lookups.  Queries are both for existence and also for position. There will be frequent changes to objects in the world.

Generally there is a hash table containing all the objects.  The hash should be a guid assigned to each object.  This is generally the master list.

There is also generally a spatial tree, such as a loose quadtree, that indicates where the guid lives in the world.  When an object's position is updated this spatial tree needs to also get updated.

There may be yet another graph, called the scene graph, used for display.  Quite likely this graph is not part of the game world since it is part of the renderer's responsibility, not world management's responsibility.

So you say better OO approach is to let the world logic tell what accessibility there is between buildings? the reason for each building to have this information is because if there's a wooden bridge then humans can travel across it, but heavy donkey carts cannot because the bridge might collapse so they need to use stone bridge instead.
every time i add new type of these buildings the pathing possibilities increase.
so i might be moving the conditional code outside the class but that seems to require keeping a list of class vs class accessibilities.