Got an idea for solving this problem efficiently and elegantly in C++?
A given graph consists of two connected sub-graphs in which every node has at least three neighbours. The sub-graphs are only connected by a single edge, the bridge. Given a node in each sub-graph, find the bridge. You can assume there is only one bridge.
Send the code to jobs@mapbox.com.
Mapbox is building a kick-ass open source routing engine that works whether you’re walking, biking, or driving. We’re looking for people who enjoy polishing their C++ code to a high sheen and wringing out its last few drops of performance.
Image may be NSFW.
Clik here to view.
