engineering recuitment UKPSC Polytechnic Lecturer Mock Test 2024 Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
Backtracking uses _______ node generation _______ bounding functions:
1
Breadth first, with
2
Breadth first, without
3
Depth-first, with
4
Depth-first, without