Add some example implementations of two candidate search method: backtracking(DFS), branch and bound(BFS or priority queue), including Container Loading, 0/1 Knapsack and Travel SalesPerson. Covers subset tree and permutation tree.