|This is a stub or unfinished. Contribute by editing me.|
Family Graph is a one of simplest Dynamic Programming problems. It's a problem of finding family relations between persons. It can solve simply by dynamic programming.
In this problem we have some persons and only have these possible relations of them: Spouse, Child, Parent we should present an algorithm to find out more about complex relations like Brother ,Sister, Uncle, Cousin etc.
In order to solve this problem we should use Floyd-Warshall's Algorithm to find shortest path of persons that we have in our family adjacency matrix. Run time will be O( n ^ 3 ) for that .