Graphs

BFS, DFS, topological sort, shortest path.

Log in to read this chapter

This chapter is part of Placements — DSA & Coding. Log in to continue reading the full lessons, notes and practice.

What you'll learn in this chapter

Graph Representations and Basics

Breadth-First Search (BFS)

Depth-First Search (DFS)

Cycle Detection in Graphs

Topological Sort

Shortest Path — Dijkstra's Algorithm

Shortest Path — Bellman-Ford and Floyd-Warshall

Union-Find and Minimum Spanning Tree