I will try to construct a generic node optimizer, to minimize number of steps needed to travel between any points/nodes within a graph tree that have symmetric branch structure.
Before i start can i ask, am i inventing the wheel again, not that it really matter i will go through with it anyway it is for recreation.
But is the optimal algorithm for travelling a symmetric branch tree in least number of steps using x extensions from y nodes already known?
Jonas