CourseStudy: compute Erdos numbers with OO design

Wiki page about Erdos number:

collaborative distance based on authorship of mathematical papers

google groups post talking about this:

using BFS to search the collaborative distance from the author to Erdos, which is a undirected graph.

contest on such problem

create BFS at first and then search each author

百度文库

BFS ppt, with some pseudo code here

somebody implement it us C language

c++ implement here:

this one is better, much like OO design here

``````````````````````````````

First, try to use "shortest path faster algorithm" (SPFA)

second, use "Breadth first searching" (BFS) algorithm.

CourseStudy