private static void SearchKGInt(IBaseContext context, Vertex prevNode, GDMIndividualRecord iRec,
KinshipsGraph graph, RelationKind relation, RelationKind inverseRelation)
{
if (iRec == null)
{
return;
}
Vertex currNode = graph.FindVertex(iRec.XRef);
if (currNode != null)
{
if (prevNode != null)
{
graph.AddRelation(prevNode, currNode, relation, inverseRelation);
}
return;
}
else
{
currNode = graph.AddIndividual(iRec);
if (prevNode != null)
{
graph.AddRelation(prevNode, currNode, relation, inverseRelation);
}
}
if (iRec.ChildToFamilyLinks.Count > 0)
{
GDMFamilyRecord fam = context.Tree.GetParentsFamily(iRec);
if (fam != null)
{
GDMIndividualRecord father, mother;
father = context.Tree.GetPtrValue(fam.Husband);
mother = context.Tree.GetPtrValue(fam.Wife);
SearchKGInt(context, currNode, father, graph, RelationKind.rkParent, RelationKind.rkChild);
SearchKGInt(context, currNode, mother, graph, RelationKind.rkParent, RelationKind.rkChild);
}
}
int num = iRec.SpouseToFamilyLinks.Count;
for (int i = 0; i < num; i++)
{
GDMFamilyRecord family = context.Tree.GetPtrValue(iRec.SpouseToFamilyLinks[i]);
GDMIndividualRecord spouse = (iRec.Sex == GDMSex.svMale) ? context.Tree.GetPtrValue(family.Wife) : context.Tree.GetPtrValue(family.Husband);
SearchKGInt(context, currNode, spouse, graph, RelationKind.rkSpouse, RelationKind.rkSpouse);
int num2 = family.Children.Count;
for (int j = 0; j < num2; j++)
{
GDMIndividualRecord child = context.Tree.GetPtrValue(family.Children[j]);
SearchKGInt(context, currNode, child, graph, RelationKind.rkChild, RelationKind.rkParent);
}
}
}
private static void SearchKGInt(Vertex prevNode, GEDCOMIndividualRecord iRec,
KinshipsGraph graph, RelationKind relation, RelationKind inverseRelation)
{
if (iRec == null)
{
return;
}
Vertex currNode = graph.FindVertex(iRec.XRef);
if (currNode != null)
{
if (prevNode != null)
{
graph.AddRelation(prevNode, currNode, relation, inverseRelation);
}
return;
}
else
{
currNode = graph.AddIndividual(iRec);
if (prevNode != null)
{
graph.AddRelation(prevNode, currNode, relation, inverseRelation);
}
}
if (iRec.ChildToFamilyLinks.Count > 0)
{
GEDCOMFamilyRecord fam = iRec.GetParentsFamily();
if (fam != null)
{
GEDCOMIndividualRecord father, mother;
father = fam.GetHusband();
mother = fam.GetWife();
SearchKGInt(currNode, father, graph, RelationKind.rkParent, RelationKind.rkChild);
SearchKGInt(currNode, mother, graph, RelationKind.rkParent, RelationKind.rkChild);
}
}
int num = iRec.SpouseToFamilyLinks.Count;
for (int i = 0; i < num; i++)
{
GEDCOMFamilyRecord family = iRec.SpouseToFamilyLinks[i].Family;
GEDCOMIndividualRecord spouse = ((iRec.Sex == GEDCOMSex.svMale) ? family.GetWife() : family.GetHusband());
SearchKGInt(currNode, spouse, graph, RelationKind.rkSpouse, RelationKind.rkSpouse);
int num2 = family.Children.Count;
for (int j = 0; j < num2; j++)
{
GEDCOMIndividualRecord child = (GEDCOMIndividualRecord)family.Children[j].Value;
SearchKGInt(currNode, child, graph, RelationKind.rkChild, RelationKind.rkParent);
}
}
}
public static KinshipsGraph SearchGraph(IBaseContext context, GDMIndividualRecord iRec)
{
if (iRec == null)
{
throw new ArgumentNullException("iRec");
}
KinshipsGraph graph = new KinshipsGraph(context);
SearchKGInt(context, null, iRec, graph, RelationKind.rkUndefined, RelationKind.rkUndefined);
return(graph);
}
