Directed Graph
Everything on SkillVeris tagged Directed Graph — collected across the glossary, study notes, blog, and cheat sheets.
7 resources across 1 library
Interview Questions(7)
What is Kosaraju's Algorithm?
Kosaraju's algorithm finds all strongly connected components (SCCs) of a directed graph in O(V + E) time using two depth-first search passes: one on the origin…
What is Tarjan's Algorithm?
Tarjan's algorithm finds all strongly connected components (SCCs) of a directed graph in a single O(V + E) DFS pass by tracking each vertex's discovery time an…
Course Schedule Problem: How Would You Solve It?
Course schedule is a cycle-detection problem on a directed graph where each course is a node and a prerequisite relationship is a directed edge, and all course…
What are Strongly Connected Components?
A strongly connected component (SCC) is a maximal set of vertices in a directed graph where every vertex can reach every other vertex in the set via a directed…
What is an Eulerian Path and Eulerian Circuit?
An Eulerian path is a walk through a graph that uses every edge exactly once, and an Eulerian circuit is an Eulerian path that starts and ends at the same vert…
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…
Directed vs Undirected Graphs: What is the Difference?
A directed graph has edges with a specific one-way direction from one vertex to another, while an undirected graph has edges that are symmetric, meaning a conn…