Olivier Langlois's blog

BOOKS i'm reading

Napoleon Hill Keys to Success: The 17 Principles of Personal Achievement, Napoleon Hill, ISBN: 978-0452272811

The 4-Hour Workweek: Escape 9-5, Live Anywhere, and Join the New Rich (Expanded and Updated), Timothy Ferriss, ISBN: 978-0307465351

The Fountainhead, Ayn Rand, ISBN: 0452273331

Archives for: August 2010

08/24/10

08:53:31 pm, by lano1106, 97 words, 7582 views

Categories: General, C++

Graph breadth-first traversal algorithm C++ implementation

I have posted on my website a small C++ program that I have been asked to write during an interview with Facebook at Fall 2009. One of their interview was related to graph theory and the problem was to find the the shortest distance between to nodes in a graph. The best algorithm to use to solve this problem is the breadth-first traversal algorithm.

You can look at the source code here at:
http://www.olivierlanglois.net/archive/graph_cpp.htm

and you can read more about the breadth-first traversal algorithm in Robert Sedgewick excellent book on algorithms.

Permalink 3 comments

I want you to find in this blog informations about C++ programming that I had a hard time to find in the first place on the web.

Sun	Mon	Tue	Wed	Thu	Fri	Sat
<< <		Current			> >>
1	2	3	4	5	6	7
8	9	10	11	12	13	14
15	16	17	18	19	20	21
22	23	24	25	26	27	28
29	30	31

Olivier Langlois's blog

Archives for: August 2010

08/24/10

Graph breadth-first traversal algorithm C++ implementation

Olivier Langlois's blog

Search

Categories

Olivier Langlois's blog

Archives

Misc

XML Feeds

Who's Online?