Basic graph, shortest-path algorithm

I need a program coded in C++ that makes a basic Genealogical database that uses a graph and a shortest path algorithm (pref breadth-first search). Families and individuals are the two kinds of vertex; each is connected only to the other. The edges from a family are called "husband", "wife", and "child", with multiple "child" edges. The edges from an individual are called "parents" and "marriage". I have attached a zip file with the program specifications and test data. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform Program needs to be coded in C++, and tested to make sure all specifications work properly.