Explore
101 visualisers you can step through forwards and backwards, with synced code and a reason for every move.
Showing 17 of 101
Pastel = track · chip = your mastery
- Graph-BasedGraphA non-linear data structure consisting of vertices and edges.O(V + E)
- Graph-BasedAdjacency ListA collection of lists used to represent a graph.O(deg(v))
- Graph-BasedAdjacency MatrixA 2D matrix used to represent a graph.O(1)
- GraphBreadth-First SearchA graph traversal algorithm that explores all vertices at the present depth.O(V + E)
- GraphDepth-First SearchA graph traversal algorithm that explores as far as possible along each branch.O(V + E)
- GraphDijkstra's AlgorithmAn algorithm for finding the shortest paths between nodes in a graph.O((V + E) log V)
- GraphBellman-Ford AlgorithmAn algorithm that computes shortest paths from a source vertex to all other vertices.O(VE)
- GraphFloyd-Warshall AlgorithmAn algorithm for finding shortest paths in a weighted graph with positive or negative edge weights.O(V³)
- GraphPrim's AlgorithmA greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.O(E log V)
- GraphKruskal's AlgorithmA minimum-spanning-tree algorithm that finds an edge of the least possible weight.O(E log E)
- GraphTopological SortA linear ordering of vertices such that for every directed edge uv, vertex u comes before v.O(V + E)
- GraphKosaraju's AlgorithmAn algorithm for finding strongly connected components of a directed graph.O(V + E)
- GraphTarjan's AlgorithmAn algorithm for finding strongly connected components of a directed graph.O(V + E)
- String MatchingRabin-Karp AlgorithmA string searching algorithm that uses hashing to find patterns.O(n + m)
- String MatchingKMP AlgorithmThe Knuth-Morris-Pratt algorithm for efficient string matching.O(n + m)
- String MatchingZ-AlgorithmAn algorithm for finding all occurrences of a pattern in a string.O(n + m)
- String MatchingManacher's AlgorithmAn algorithm to find the longest palindromic substring in linear time.O(n)