Private float GetRightBoundaryAncestor(Person psn)
Arrange the siblings base on my position (left younger, right older) Should not happen, checking in start of function If (psn.Father != null & psn.Mother != null) Private void CalcPositionRecurse(Person psn) / Calculate position of genogram using recursion Then offset the position of all marriage and person with that to make it start from zero Get the minimum value (must be negative) Normalize the position (shift all values to positive value) Search the start node (The only node with targetFlg set to true) it is programmed in c# using graphics to draw on a bitmap.Ĭurrent algorithm for calculating x position, the y position is by getting the generation number. but I am wondering how to do it in non recursive way to make it more efficient.
I currently was tasked to make a genogram for a family consisting of siblings, parents with aunts and uncles with grandparents and greatgrandparents for only blood relatives.
0 kommentar(er)
