hardShortest Path
QuizCompute shortest paths with negative edges and detect negative cycles.
Open Workstation
A non-linear data structure consisting of nodes and edges connecting them. Choose an algorithm below to launch its interactive simulation workstation.
Showing 9 of 9 algorithms
Compute shortest paths with negative edges and detect negative cycles.
Find all maximal connected subgraphs in an undirected graph.
Detect cycles in graphs via DFS: 3-color state classification for directed graphs and parent-edge tracking for undirected graphs.
Find shortest paths from a source in a graph with non-negative edge weights.
Construct Minimum Spanning Tree by sorting edges and using Union-Find.
Grow a Minimum Spanning Tree from an arbitrary root vertex.
Linear ordering of vertices in a DAG respecting directed dependencies.
Explore all neighbor nodes at the present depth before moving on to nodes at the next depth level.
Explore as far as possible along each branch before backtracking.