A graph theoretic definition of pedigrees is given and a distinction drawn between simple and complex pedigrees. Algorithms are presented to calculate the likelihood of any kind of pedigree, assuming only segregation at a finite set of loci, nonassortative mating and no environmental correlations; multiple births and consanguineous marriages are explicitly allowed for. The formulation given can lead to more powerful genetic counselling, segregation analysis and linkage analysis.