all relation ship between two vertices in a DAG

Usage
1

Hi
I am an old user of GRAMPS software to make my genealogy. Amd i m wondering if python-igrah can overcome some low speed troutine in GRAMPS.
Especially for instance to find all relatinship path between two person.
Then inside gramps which is written in python i have make an addon that create the graph.
This one is directed with the relation parent → child.
I have some experientation to find ancestors and so on and it s damn fast.
But now i would like to go this peculiar problem of finding all relationship path and i m wondering if this kind of function exist.

I have found the get_all_simple_paths fonction but i have a problem with that. It s related to the mode parameter.
I would like to search with the out parameter but for both vertices.

2

I’m sorry, I don’t follow what you mean. If you can give a concrete example of a graph, and what you want to do with that graph, we might be able to suggest something.

3

ok
let me take an example.
i have make the attached genealogical tree.
And i want to find all the relationship path from Arthur Leon to Edouard Leon.

the good result is
,Arthur Leon,Bob Leon,Bert Leon,Alberito Leon,Edouard Leon
,Arthur Leon,Bob Leon,Josi Smith,Alberito Leon,Edouard Leon

But the simplepath fonction give me

,Arthur Leon,Bob Leon,Bert Leon,Alberito Leon,Josi Smith,Hung Smith,Illa Smith,Herb Thorne,Bob Thorne,Tyre Thorne,Duke Thorne,Lina Thorne,Edouard Leon
,Arthur Leon,Bob Leon,Bert Leon,Alberito Leon,Josi Smith,Hung Smith,Illa Smith,Herb Thorne,Bob Thorne,Lili Sung,Duke Thorne,Lina Thorne,Edouard Leon
,Arthur Leon,Bob Leon,Bert Leon,Alberito Leon,Josi Smith,zare linea,Illa Smith,Herb Thorne,Bob Thorne,Tyre Thorne,Duke Thorne,Lina Thorne,Edouard Leon
,Arthur Leon,Bob Leon,Bert Leon,Alberito Leon,Josi Smith,zare linea,Illa Smith,Herb Thorne,Bob Thorne,Lili Sung,Duke Thorne,Lina Thorne,Edouard Leon
,Arthur Leon,Bob Leon,Bert Leon,Alberito Leon,Edouard Leon
,Arthur Leon,Bob Leon,Josi Smith,Alberito Leon,Edouard Leon
,Arthur Leon,Bob Leon,Josi Smith,Hung Smith,Illa Smith,Herb Thorne,Bob Thorne,Tyre Thorne,Duke Thorne,Lina Thorne,Edouard Leon
,Arthur Leon,Bob Leon,Josi Smith,Hung Smith,Illa Smith,Herb Thorne,Bob Thorne,Lili Sung,Duke Thorne,Lina Thorne,Edouard Leon
,Arthur Leon,Bob Leon,Josi Smith,zare linea,Illa Smith,Herb Thorne,Bob Thorne,Tyre Thorne,Duke Thorne,Lina Thorne,Edouard Leon
,Arthur Leon,Bob Leon,Josi Smith,zare linea,Illa Smith,Herb Thorne,Bob Thorne,Lili Sung,Duke Thorne,Lina Thorne,Edouard Leon

We should only move up to ancestor and go down to descendant.

graph_rel_graph
graph_rel_graph611×789 57.9 KB

4

What did you name the yellow nodes in your graph? Perhaps you are looking at the shortest path (with mode=ALL) instead of all paths?

5

Hi the graph representaiton is’nt really a good one.
the yellow node are not really nodes. it s only marriage between the parents and the child is issued from the marriage.
Here is a better representation from a graph point of view

myfile
myfile600×600 34.9 KB