Skip to content

Backend / Algorithms & data structures / 05_graphs/

Graphs

index source

This folder has no README. Everything inside it is listed below.

Notes

Graph algorithms — BFS, DFS, topological sort, union-find 4 For dense graphs or weighted graphs, sometimes adjacency matrix or list of (weight, neighbor) tuples.
Dijkstra's algorithm — shortest path in weighted graph 4 For non-negative weights. With a binary heap (Python's heapq): O((V+E) log V).