Graph Theory
Everything on SkillVeris tagged Graph Theory — collected across the glossary, study notes, blog, and cheat sheets.
7 resources across 1 library
Interview Questions(7)
What is Dijkstra’s Algorithm?
Dijkstra’s algorithm finds the shortest path from a single source vertex to every other vertex in a weighted graph with non-negative edge weights, using a gree…
How Do You Check if a Graph is Bipartite?
A graph is bipartite if its vertices can be split into two groups so that every edge connects a vertex in one group to a vertex in the other, and you check thi…
How Do You Detect a Cycle in a Directed Graph?
You detect a cycle in a directed graph with DFS that tracks each node's state as unvisited, in the current recursion path, or fully processed — a cycle exists…
How Do You Detect a Cycle in an Undirected Graph?
You detect a cycle in an undirected graph with DFS (or BFS) that tracks each node's immediate parent, and a cycle exists if you reach an already-visited neighb…
What is Tree Dynamic Programming?
Tree dynamic programming solves a problem on a tree by computing a DP value at each node from the already-solved DP values of its children, using a post-order…
What is Heavy-Light Decomposition?
Heavy-light decomposition splits a tree into vertical chains so that any root-to-node path crosses at most O(log n) chains, letting path queries (sum, max, upd…
What Is the Circular Wait Condition in Deadlock?
The circular wait condition is one of the four necessary conditions for deadlock, and it means there exists a closed chain of two or more processes where each…