ЁЯМР What is a Spanning Tree? Take a connected graph (a set of points joined by lines).A...
Algorithms
ЁЯМЙ What Is Graph Traversal? Imagine youтАЩre exploring a new city.You start from one place and slowly...
Shortest Path Algorithm Imagine youтАЩre standing in a new city with several streets connecting different places.You want...
WarshallтАЩs Algorithm WarshallтАЩs Algorithm is a neat trick that answers this question for every pair of vertices...
Graph Traversal MCQs ЁЯТа Graph Traversals тАУ GATE-Level MCQs (Algorithms) Q1. Breadth-First Search (BFS) uses which data...
Divide & Conquer (Algorithm Design Techniques) (Wait: correct: for a=1,b=2, n^{log_b a}=n^0=1; f(n)=n which is polynomially larger...
Dynamic Programming (Algorithm Design Techniques)
