1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 const int maxn = 10; 8 struct edge{ 9 int to, cost;10 edge(in...
BFS and DFS - know their computational complexity, their tradeoffs, and how to implement them in real code When asked a question, look for a graph-based solution first, then move on if none. MIT(videos): Breadth-First Search Depth-First Search Skiena Lectures - great intro: CSE373 2012 ...