Given a directed acyclic graph (DAG), perform a topological sort and return the linear ordering of vertices that respects the partial order.
MEDIUM
dijkstras-shortest-path
Dijkstra's Shortest Path Algorithm
Given a weighted graph and a starting vertex, find the shortest path to all other vertices using Dijkstra's algorithm. Return the shortest distances and paths.
HARD
depth-first-search
Depth-First Search (DFS)
Given a graph, perform a depth-first traversal starting from a specified vertex. Return the order in which vertices are visited.
MEDIUM
breadth-first-search
Breadth-First Search (BFS)
Given a graph, perform a breadth-first traversal starting from a specified vertex. Return the order in which vertices are visited.