is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
The problem, as I understand, can be solved through using a graph structure.
- shilo.kate February 26, 2010If you have to use the Relational Database, you could create many-to-many relations between nodes(bus stop) and edges(with weight). Retrieve them into a standard structure (Directed graph) and then you could use standard algorithms (or methods) on the structure.
You could also use Neo4j (the Graph Database). It is easily expandable!