Family Graph

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.

Overview
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.

Solution
In order to solve this problem we should use Floyd-Warshall Algorithm to find shortest path of persons that we have in our family adjacency matrix.

Sample Program
This program is java implementation of this algorithm witch developed By Azadeh Dehghan Manshady & Soroush Vedaee in BIHE university of Iran. Download Link --soroush 15:14, 7 February 2009 (UTC)