DSA-VerseLearn by watching code run
DashboardData StructuresAlgorithmsVisualizerCORECoding PlaygroundInterview QuestionsComplexity AnalyzerLearning NotesBookmarksLearning ProgressSettings

Algorithms

Explanations, pseudocode, an embedded interactive visualization, implementations in JavaScript, Python, Java and Go, complexity and interview variations.

Graph Algorithms

Graph BFS (Breadth-First Search)

Interactive

Explores the graph level by level using a queue. Because vertices are discovered in order of distance, BFS also finds the shortest path (fewest edges) from the start in an unweighted graph.

O(V + E) · 4 languages

Graph DFS (Depth-First Search)

Interactive

Goes as deep as possible along each branch before backtracking. This recursive version uses the call stack as its implicit stack.

O(V + E) · 4 languages

Dijkstra's Algorithm

Planned

Shortest paths with non-negative weights using a min-priority queue.

O((V + E) log V)

Bellman-Ford

Planned

Relax every edge V−1 times; detects negative cycles.

O(V·E)

Floyd-Warshall

Planned

All-pairs shortest paths by dynamic programming over intermediate vertices.

O(V³)

Topological Sorting

Planned

Linear order of a DAG respecting every edge (Kahn's algorithm / DFS).

O(V + E)

Kruskal's Algorithm

Planned

Minimum spanning tree by adding cheapest edges with Union-Find.

O(E log E)

Prim's Algorithm

Planned

Grow a minimum spanning tree from one vertex with a priority queue.

O(E log V)