FamilyTree layout

godlikesme · July 19, 2007, 3:13pm

Never mind. It does “snap to grid”. I do have another MAJOR problem that has been keeping me from getting GoDiagram from working just the way I need it to.

Basically, when I am trying to add parents to a node that is at the very top of my grid instead of positioning the new parents at the very top and "pushing" all of the other nodes downward to make room it puts the 2 new nodes at random positions next to or beneath the existing child that had the parents added to it and looks something like this:

Legend:

1. Green lines represent marriage link.

2. Red Lines represent daughter link.

3. Blue lines represent son link.

4. Red circles represent females.

5. Blue squares represent males.

The original nodes were 1 & 2 as the parents of female child 3. Then parents 4 & 5 were added to node 1.

As you can see, instead of inserting the new generation of parents at the top and creating a normal orthogonal design it wrapped the nodes around the top elements.

Of all the samples you guys provide, I believe the family tree was the closest in concept to what I need to do (although it was pretty far off). However, the problem with the way it generates the tree is that it assumes the lower the nodeid the higher up in the tree it is. In other words it doesn't take into account that nodes may be added "upwards" for previous generations as well as "downwards".

Either way I have been working on this on and off for about 5 months and my deadline is fast approaching. Is there any way to accomplish what I am trying to do?

Thanks in advance.

walter · July 19, 2007, 3:45pm

You can change the code in FamilyTreeDoc.LayoutNodes not to look for the PersonNode with the lowest ID. If you already know a “root” node, use it. If you don’t, you’ll need to walk the whole diagram to assign generations to each PersonNode, and then find a Parent-less PersonNode that is in the oldest generation.

godlikesme · July 19, 2007, 4:02pm

I was afraid you’d say something like that.

Since there technically isn't going to always be 1 root node (i.e. when people "marry into" a family then all of the new in-laws and their relatives sort of screw up that concept. Also, going with that concept, what if there are multiple Parent-less PersonNodes that are in the oldest generation?

Thanks Again.

-Ami

PS: So basically I would have to update the algorithm that looks for the root node to also check for the node's generation and each time I find a lower number for the generation I then reset the root node to that new node?

walter · July 19, 2007, 4:08pm

Well, assigning generations to each PersonNode shouldn’t be too hard.

Also, this is why people buy GoLayout. Some customization would be needed to identify spouses as being in the same level (i.e. generation) and to identify the children, since the links are coming out of the marriage link instead of a node. I thought we had done that (commented out), but now that I look at the code, apparently that was just for JGo.

godlikesme · July 19, 2007, 4:10pm

My company does own full licenses (with source code) for GoDiagram and I believe GoLayout. Is there a number I can call to have someone walk me through what I need to do?

walter · July 19, 2007, 4:18pm

It’s an interesting test for GoLayout, so I’ll look into it as soon as I get a chance.

godlikesme · July 19, 2007, 4:20pm

Thank you.

I really appreciate that.

It would be really fantastic if you guys got that functionality to work.

godlikesme · July 19, 2007, 6:36pm

Walter,

I was wondering something. What determines the location of nodes? The rectangle/subrectangles or the action position values?

I am still trying to understand how each level in a diagram works. Is there a different subrectangle for each new level that contains the next generation of nodes?

-Ami

walter · July 20, 2007, 7:53am

You can position any GoObject by setting its Position or Location property. Positions/locations/sizes are (X,Y) floating point numbers in "document" coordinates, which are different than the integer "view" or Control coordinates, since GoViews support translation (scrolling) and scaling (zooming).

No, levels are not contained or enclosed by any GoObjects -- each node and each link is a top-level GoObject in the GoDocument. (Actually in a GoLayer in the GoDocument.)

walter · July 20, 2007, 8:01am

OK, here’s a replacement FamilyTreeDoc.cs. You’ll need to add a reference to Northwoods.Go.Layout.dll, copy the licenses.licx file from LayoutDemo, and uncomment out the #define.

/* * Copyright © Northwoods Software Corporation, 1998-2007. All Rights * Reserved. * * Restricted Rights: Use, duplication, or disclosure by the U.S. * Government is subject to restrictions as set forth in subparagraph * (c) (1) (ii) of DFARS 252.227-7013, or in FAR 52.227-19, or in FAR * 52.227-14 Alt. III, as applicable. */ // If you want to use GoLayoutLayeredDigraph to do the family tree layout, // uncomment the following line, just in this file: //#define GOLAYOUT using System; using System.Drawing; using System.Collections; using Northwoods.Go; #if GOLAYOUT using Northwoods.Go.Layout; #endif namespace FamilyTree { /** * FamilyTreeDoc is a GoDocument that manages the GoObjects used to display * family tree information in a GoView. * * The primary purpose is to convert the database information in a GenDB * object (with its Persons) into GoObjects: PersonNodes and GoLinks * representing marriages and resultant children. * * There are three kinds of top-level objects in the document: * a PersonNode representing Person, * a GoLabeledLink representing a marriage between two Persons, * a GoLink linking a child with the marriage between its mother and father. * * For each of these three kind of objects, there are "Find..." and "Get..." * methods: FindNode(), GetNode(), FindMarriageLink(), GetMarriageLink(), * FindChildLink(), and GetChildLink(). The "Find..." versions just look * for an existing object representing the Person or relationship between * Persons. The "Get..." versions return either the existing object or a * newly created GoObject corresponding to the given Person or relationship. * * This design is unusual in that it the label of a marriage link is not * a GoLinkLabel (a GoText), but a GoPort, which in turn is attached to * links to all of that marriage's children. * * There are also methods to lay out the PersonNodes in the document in * a potentially reasonable way, starting with older generations at the * top, placing spouses next to each other, with their children below them. */ [Serializable] public class FamilyTreeDoc : GoDocument { public FamilyTreeDoc() { this.DB.Load(); this.LinksLayer = this.Layers.CreateNewLayerBefore(this.Layers.Default); } public void InitNodes() { // Iterate over all the Persons in the database foreach (DictionaryEntry entry in this.DB.GetHashtable()) { Person p = entry.Value as Person; if (p == null) continue; // Make sure the PersonNode exists for the Person PersonNode pn = GetNode(p); // Get the mother and create the PersonNode for her // if such a Person exists Person mother = this.DB.FindPerson(p.mother); PersonNode mothernode = GetNode(mother); // Get the father and create the PersonNode for him // if such a Person exists Person father = this.DB.FindPerson(p.father); PersonNode fathernode = GetNode(father); // Create a child link GetChildLink(fathernode, mothernode, pn); // Create any marriage links for this Person ArrayList marriages = p.spouseslist; for (int i = 0; i < marriages.Count; i++) { // Person stores references to other persons not // as pointers, but as integer identifiers int spouseID = (int)marriages[i]; // Get the spouse as a Person Person spouse = this.DB.FindPerson(spouseID); // Make sure the PersonNode exists for the spouse PersonNode spousenode = GetNode(spouse); // Now we can make sure the GoLink exists between them GetMarriageLink(pn, spousenode); } } // try to position all the PersonNodes nicely LayoutNodes(); // add a caption // don't care about undo/redo, so don't need to call fireForedate here GoComment caption = new GoComment(); caption.Text = "Some of the Tudors of English royalty in the 1500's.\r\n" + "\r\n" + "Women are pink; men are blue; marriage links are green.\r\n" + "\r\n" + "Tooltips provide more information about each person.\r\n" + "DELETE to remove selected people from the tree;\r\n" + "CTRL-L to reposition all the people;\r\n" + "INSERT to start over with the original tree;\r\n" + "CTRL-P to print; CTRL-Q to quit."; caption.Editable = false; caption.Label.Editable = false; caption.Position = new PointF(250, 380); Add(caption); } // If we already know about a PersonNode for a given object, // return it, else return null public PersonNode FindNode(Person key) { if (key == null) return null; Object val = myMap[key]; return val as PersonNode; } // Get a PersonNode for a given object, using an existing one // if possible, otherwise creating one public PersonNode GetNode(Person key) { if (key == null) return null; PersonNode node = FindNode(key); if (node == null) { node = new PersonNode(); node.Person = key; // initialize and keep back pointer // PersonNodes are always in front of any links Add(node); // keep track of Person --> PersonNode mapping myMap[key] = node; } return node; } // Override the standard document behavior to clean up the entry // in the hash table from Person to PersonNode public override void Remove(GoObject obj) { if (obj is PersonNode) { PersonNode node = (PersonNode)obj; Object key = node.Person; if (key != null) myMap.Remove(key); } base.Remove(obj); } // Override the standard document behavior to clean up all the // entries in the hash table from Person to PersonNode public override void Clear() { myMap.Clear(); base.Clear(); } // If we can find a marriage link between the two given people, // return it public GoLabeledLink FindMarriageLink(PersonNode p1, PersonNode p2) { if (p1 == null) return null; if (p2 == null) return null; // marriage links are always connected at the TextNode's BottomPort GoPort p1p = p1.BottomPort; GoPort p2p = p2.BottomPort; foreach (IGoLink l in p1p.Links) { GoLabeledLink link = l as GoLabeledLink; if (link == null) continue; GoPort other = link.GetOtherPort(p1p) as GoPort; if (other == p2p) return link; } return null; } // Create a marriage link between the two given people if it does // not already exist public GoLabeledLink GetMarriageLink(PersonNode p1, PersonNode p2) { if (p1 == null) return null; if (p2 == null) return null; GoLabeledLink l = FindMarriageLink(p1, p2); if (l == null) { // marriage links are always connected at the TextNode's BottomPort GoPort p1p = p1.BottomPort; GoPort p2p = p2.BottomPort; // create a labeled link, with the middle label being a port! l = new GoLabeledLink(); l.FromPort = p1p; l.ToPort = p2p; l.Selectable = false; l.RealLink.Pen = MarriageLinkPen; GoPort midp = new GoPort(); midp.Size = new SizeF(); midp.Style = GoPortStyle.None; midp.EndSegmentLength = 20; midp.FromSpot = GoObject.MiddleBottom; midp.ToSpot = GoObject.MiddleBottom; l.MidLabel = midp; // marriage links are always behind any nodes this.LinksLayer.Add(l); } return l; } // To improve the appearance of child links, the port on the // marriage link for the child links can be at either end as // well as at the middle public GoPort GetMarriageLinkPortForChild(GoLabeledLink link) { GoPort mp = (GoPort)link.MidLabel; if (mp == null) mp = (GoPort)link.ToLabel; if (mp == null) mp = (GoPort)link.FromLabel; return mp; } // If we can find a child link between the given person and a marriage // link between the two given parents, return it public GoLink FindChildLink(PersonNode p1, PersonNode p2, PersonNode c) { if (p1 == null) return null; if (p2 == null) return null; if (c == null) return null; // make sure there's a marriage between p1 and p2 GoLabeledLink m = FindMarriageLink(p1, p2); if (m == null) return null; GoPort mp = GetMarriageLinkPortForChild(m); // look at c's parentport's link GoPort cp = c.TopPort; foreach (IGoLink l in cp.Links) { GoLink link = l as GoLink; if (link == null) continue; // found a child link--is it the right one? GoPort cmp = link.GetOtherPort(cp) as GoPort; if (cmp == mp) return link; } return null; } // Return an existing child link, if any, or else make sure a // marriage link exists between the two parents and then create a // child link from the marriage link to the child node public GoLink GetChildLink(PersonNode p1, PersonNode p2, PersonNode c) { if (p1 == null) return null; if (p2 == null) return null; if (c == null) return null; GoLink cl = FindChildLink(p1, p2, c); if (cl == null) { GoLabeledLink m = GetMarriageLink(p1, p2); GoPort mp = GetMarriageLinkPortForChild(m); // parent port is always the TopPort GoPort cp = c.TopPort; cl = new GoLink(); cl.FromPort = mp; cl.ToPort = cp; cl.Selectable = false; if (c.Person.IsMale) cl.Pen = SonLinkPen; else if (c.Person.IsFemale) cl.Pen = DaughterLinkPen; else cl.Pen = Pens.Black; // child links are always behind any nodes this.LinksLayer.Add(cl); } return cl; } // Place all the people where they belong. Start with the parent-less // person with the lowest ID, call layoutTree() for that person, and // then call layoutTree() repeatedly while unplaced people remain. #if GOLAYOUT public void LayoutNodes() { GoLayoutLayeredDigraph layout = new FamilyLDAL(this); layout.PerformLayout(); } #else public void LayoutNodes() { RectangleF rect = new RectangleF(10, 10, 0, 0); // initial top-left position RaiseChanging(GoDocument.AllArranged, 0, null); PersonNode root = null; int lowestID = 99999999; // move all nodes so they appear unpositioned foreach (GoObject obj in this) { if (obj is PersonNode) { PersonNode node = (PersonNode)obj; node.Position = new PointF(0, 0); Person p = node.Person; if ((p.number < lowestID) && node.TopPort.LinksCount == 0) { root = node; lowestID = p.number; } } } // start with Person with lowest ID having no parents LayoutTree(root, ref rect); rect.X = rect.X + rect.Width; rect.Width = 0; // find all parentless, unpositioned known person nodes and lay them out foreach (GoObject obj in this) { if (obj is PersonNode) { PersonNode node = (PersonNode)obj; Person p = node.Person; if (!IsPositioned(node) && node.TopPort.LinksCount == 0) { LayoutTree(node, ref rect); rect.X = rect.X + rect.Width; rect.Width = 0; } } } RaiseChanged(GoDocument.AllArranged, 0, null, 0, null, NullRect, 0, null, NullRect); this.Bounds = ComputeBounds(); } // implement a simple tree-layout algorithm // ORIGRECT is modified to reflect the resultant placements private void LayoutTree(PersonNode node, ref RectangleF origrect) { if (IsPositioned(node)) return; float spousewidth = 0; RectangleF childrect = new RectangleF(); childrect.X = origrect.X + origrect.Width; childrect.Y = origrect.Y + node.Height + VertSeparation; childrect.Width = 0; // childrect.height is ignored // iterate through all the person's marriages GoPort outp = node.BottomPort; foreach (IGoLink l in outp.Links) { GoLabeledLink link = l as GoLabeledLink; if (link == null) continue; GoPort spousep = link.GetOtherPort(outp) as GoPort; PersonNode spousenode = (PersonNode)spousep.Parent; // parent group is a PersonNode // iterate over the children of this marriage GoPort mp = GetMarriageLinkPortForChild(link); // put the marriageportforchild near the spouse, to handle // multiple spouses more reasonably if (link.FromPort == spousep) link.FromLabel = mp; else if (link.ToPort == spousep) link.ToLabel = mp; // now look at each child foreach (IGoLink cl in mp.Links) { GoLink childlink = cl as GoLink; if (childlink == null) continue; GoPort childp = childlink.GetOtherPort(mp) as GoPort; PersonNode childnode = (PersonNode)childp.Parent; LayoutTree(childnode, ref childrect); } // now position the spouse immediately below the node if (!IsPositioned(spousenode)) { spousenode.Position = new PointF(origrect.X + origrect.Width + spousewidth + HorizSeparation, origrect.Y + node.Height); spousewidth += spousenode.Width + HorizSeparation; } } // figure out the maximum width for the node, all the spouses, // and all the children float parentwidth = Math.Max(node.Width, spousewidth); float subtreewidth = Math.Max(parentwidth, childrect.Width); // place this node, centered node.SetSpotLocation(GoObject.MiddleTop, new PointF(origrect.X + origrect.Width + subtreewidth/2 + HorizSeparation, origrect.Y)); // place all the spouses, centered if (spousewidth < subtreewidth) { // figure out horizontal offset float offset = (subtreewidth - spousewidth)/2; foreach (IGoLink l in outp.Links) { GoLabeledLink link = l as GoLabeledLink; if (link == null) continue; GoPort spousep = link.GetOtherPort(outp) as GoPort; PersonNode spousenode = (PersonNode)spousep.Parent; // parent group is PersonNode // only adjust a spouse if it's located here if ((spousenode.Left >= origrect.X + origrect.Width) && (spousenode.Left <= origrect.X + origrect.Width + subtreewidth)) spousenode.Left = spousenode.Left + offset; } } // return the effective width of this subtree origrect.Width += subtreewidth + HorizSeparation; } private bool IsPositioned(PersonNode pn) { return (pn.Left >= 10 || pn.Top >= 10); } // node spacing public float VertSeparation = 80; public float HorizSeparation = 4; #endif // !GOLAYOUT public GenDB DB { get { return myDB; } } // link parameterization public Pen MarriageLinkPen = new Pen(Color.Green, 2); public Pen DaughterLinkPen = Pens.Red; public Pen SonLinkPen = Pens.Blue; // the "genealogical database" private GenDB myDB = new GenDB(); // map Persons to PersonNodes private Hashtable myMap = new Hashtable(); } #if GOLAYOUT public class FamilyLDAL : GoLayoutLayeredDigraph { public FamilyLDAL(GoDocument doc) { this.DirectionOption = GoLayoutDirection.Down; this.ColumnSpacing = 3; this.Document = doc; // customize the Network to reflect the real relationships GoLayoutLayeredDigraphNetwork net = new GoLayoutLayeredDigraphNetwork(); foreach (GoObject obj in this.Document) { // each PersonNode gets a GoLayoutLayeredDigraphNetworkNode PersonNode n = obj as PersonNode; if (n != null) net.AddNode(n); } foreach (GoObject obj in this.Document) { // for each marriage link, GoLabeledLink marriage = obj as GoLabeledLink; if (marriage != null) { // create a link from each spouse to a dummy node representing the marriage GoPort mp = ((FamilyTreeDoc)this.Document).GetMarriageLinkPortForChild(marriage); GoLayoutLayeredDigraphNode mnode = net.CreateNetworkNode(); mnode.GoObject = mp; net.AddNode(mnode); GoLayoutLayeredDigraphLink link; link = net.CreateNetworkLink(); link.FromNode = net.FindNode(marriage.FromNode.GoObject); link.ToNode = mnode; net.AddLink(link); link = net.CreateNetworkLink(); link.FromNode = net.FindNode(marriage.ToNode.GoObject); link.ToNode = mnode; net.AddLink(link); // then create a link from the dummy marriage node to each child foreach (GoLink l in mp.Links) { PersonNode child = l.GetOtherPort(mp).GoObject.ParentNode as PersonNode; if (child == null) return; link = net.CreateNetworkLink(); link.GoObject = l; link.FromNode = mnode; link.ToNode = net.FindNode(child); net.AddLink(link); // and add a dummy link from the dummy marriage node to each child's spouse foreach (GoLabeledLink childm in child.BottomPort.Links) { PersonNode childspouse = childm.GetOtherNode(child).GoObject as PersonNode; if (childspouse == null) return; link = net.CreateNetworkLink(); link.FromNode = mnode; link.ToNode = net.FindNode(childspouse); net.AddLink(link); } } } } this.Network = net; } public override void PerformLayout() { base.PerformLayout(); foreach (GoObject obj in this.Document) { PersonNode n = obj as PersonNode; // shift up PersonNodes that have parents if (n != null && n.TopPort.LinksCount > 0) { n.Top -= n.Height; if (n.BottomPort.LinksCount == 1) { // also shift up their spouses, if they have only one foreach (GoLabeledLink spousem in n.BottomPort.Links) { PersonNode spouse = spousem.GetOtherNode(n).GoObject as PersonNode; spouse.Top -= spouse.Height; } } } } this.Document.Bounds = this.Document.ComputeBounds(); } } #endif }

godlikesme · August 14, 2007, 12:49pm

Where is the “Bounds” property defined?

walter · August 14, 2007, 1:21pm

Are you talking about GoDocument.Bounds? That’s a new property (I have forgotten which version, but I think 2.6) which is just the combination of the GoDocument.TopLeft and GoDocument.Size properties.

godlikesme · August 16, 2007, 12:53am

If my company purchased version 2.5.2 in September do we get free upgrades to 2.6.2?

walter · August 16, 2007, 6:06am

If you purchased a subscription, yes.

godlikesme · August 17, 2007, 3:09pm

Regarding the code you provided me above, how can I get rid of the "root" node?

It seems as if this "mystery" node always appears at the top of my family tree and then when the loop iterates through all of the "real" Person objects that are stored in my Hash table it makes them children of this phantom root node.

If you check out the picture below, you'll see that at the very top of the tree there are 2 squares. One is gray and the other green. Since the smaller square is the same color as a marriage link and seems to follow the larger gray square wherever I move it I can only assume that it is in fact a marriage link indicating that the root node is MARRIED TO ITSELF and it's children are the first two REAL Person objects in my Hash table. There are child links that stem from that root node to my first REAL Person nodes that are son and daughter links (i.e. red and blue). I have put an X through those 2 links indicating that they should not be there b/c the root node at the top should not be there either.

Still trying to figure out how to get rid of "phantom root node".

walter · August 17, 2007, 4:34pm

I don’t think the FamilyTree sample application has a single root node that is “married” to itself, so that must be something that you have created in your application, along with the parent links to “n/a” and “AQW5”.