I have just used the Isotammi deep connections graph. It gives me only the attached graph. It connects Emily Kate Coward with her grandfather Thomas Jay only via the fact that Thomas was a witness to his daughter’s, Agnes Ellen’s, marriage.
The Deep connections gramplet shows the direct relationship:
Perkins, Cecily Frances [sixth cousin]
child of Perkins, Alfred [fifth cousin once removed (up)]
child of Jay, Eliza Emma [fourth cousin twice removed (up)]
child of Jay, Alfred [third cousin three times removed (up)]
child of Jay, John [second cousin four times removed (up)]
child of Jay, William [first cousin five times removed (up)]
child of Jay, John [fourth great granduncle]
sibling of Jay, Mary [fourth great grandmother]
mother of Jay, Jeremiah [third great grandfather]
father of Jay, Thomas [second great grandfather]
father of Jay, Agnes Ellen [great grandmother]
mother of Coward, Emily Kate [grandmother]
mother of Lynch, William Francis [father]
father of Lynch, David John
Please can someone tell me why I’m not getting the direct relationship.
Python: 3.6.4 (default, Jan 23 2018, 13:17:37) …
BSDDB: 6.1.0 (6, 0, 30)
sqlite: 3.21.0 (2.6.0)
You may need to raise the issue directly with them as these addons are not supplied by Gramps Addons!
Kari @kku is the author of the Deep Connections graph. But there are 3 more contacts here with the Isotammi project, @PeterPower , @jpek-m and @TimNal. I’m unaware of who does what with the project. So one might be the better person confirming a bug or identifying user misinterpretation.
Thanks, I have messaged Kari @kku
I guess the reason is that the algorithm used by “Deep Connections Graph” is not perfect. For example, if it has already found a route that goes via a certain person then it will not reconsider another route via that same person.
You might want to uncheck the “Use events” checkbox and see if you then get the other path.
I have also noticed that the algorithm seems to miss the expected paths in many cases. I have tried to rewrite the algorithm but no success so far! I should probably use Dijkstra’s algorithm in some way - it would always find the shortest route. But actually I would like to find a number of short routes - not just the shortest one.
Thanks, it works as expected if I unchecked “use events”.
This topic was automatically closed 30 days after the last reply. New replies are no longer allowed.