好网站，可以看各种数据结构的动态

我会带着你远行 2022-10-07 08:58 62阅读 0赞

[https://www.cs.usfca.edu/~galles/visualization/Algorithms.html][https_www.cs.usfca.edu_galles_visualization_Algorithms.html]

Currently, we have visualizations for the following data structures and algorithms:

*  Basics
    
     *  [Stack: Array Implementation][Stack_ Array Implementation]
     *  [Stack: Linked List Implementation][Stack_ Linked List Implementation]
     *  [Queues: Array Implementation][Queues_ Array Implementation]
     *  [Queues: Linked List Implementation][Queues_ Linked List Implementation]
     *  Lists: Array Implementation (available in [java][] version)
     *  Lists: Linked List Implementation (available in [java][] version)
 *  Recursion
    
     *  [Factorial][]
     *  [Reversing a String][]
     *  [N-Queens Problem][]
 *  Indexing
    
     *  [Binary and Linear Search (of sorted list)][Binary and Linear Search _of sorted list]
     *  [Binary Search Trees][]
     *  [AVL Trees (Balanced binary search trees)][AVL Trees _Balanced binary search trees]
     *  [Red-Black Trees][]
     *  [Splay Trees][]
     *  [Open Hash Tables (Closed Addressing)][Open Hash Tables _Closed Addressing]
     *  [Closed Hash Tables (Open Addressing)][Closed Hash Tables _Open Addressing]
     *  [Closed Hash Tables, using buckets][Closed Hash Tables_ using buckets]
     *  [Trie (Prefix Tree, 26-ary Tree)][Trie _Prefix Tree_ 26-ary Tree]
     *  [Radix Tree (Compact Trie)][Radix Tree _Compact Trie]
     *  [Ternary Search Tree (Trie with BST of children)][Ternary Search Tree _Trie with BST of children]
     *  [B Trees][]
     *  [B+ Trees][B_ Trees]
 *  Sorting
    
     *  [Comparison Sorting][]
        
         *  Bubble Sort
         *  Selection Sort
         *  Insertion Sort
         *  Shell Sort
         *  Merge Sort
         *  Quck Sort
     *  [Bucket Sort][]
     *  [Counting Sort][]
     *  [Radix Sort][]
     *  [Heap Sort][]
 *  Heap-like Data Structures
    
     *  [Heaps][]
     *  [Binomial Queues][]
     *  [Fibonacci Heaps][]
     *  [Leftist Heaps][]
     *  [Skew Heaps][]
 *  Graph Algorithms
    
     *  [Breadth-First Search][]
     *  [Depth-First Search][]
     *  [Connected Components][]
     *  [Dijkstra's Shortest Path][Dijkstra_s Shortest Path]
     *  [Prim's Minimum Cost Spanning Tree][Prim_s Minimum Cost Spanning Tree]
     *  [Topological Sort (Using Indegree array)][Topological Sort _Using Indegree array]
     *  [Topological Sort (Using DFS)][Topological Sort _Using DFS]
     *  [Floyd-Warshall (all pairs shortest paths)][Floyd-Warshall _all pairs shortest paths]
     *  [Kruskal Minimum Cost Spanning Tree Algorithm][]
 *  Dynamic Programming
    
     *  [Calculating nth Fibonacci number][]
     *  [Making Change][]
     *  [Longest Common Subsequence][]
 *  Geometric Algorithms
    
     *  [2D Rotation and Scale Matrices][]
     *  [2D Rotation and Translation Matrices][]
     *  [2D Changing Coordinate Systems][]
     *  [3D Rotation and Scale Matrices][]
     *  [3D Changing Coordinate Systems][]
 *  Others ...
    
     *  [Disjoint Sets][]
     *  Huffman Coding (available in [java][] version)

[https_www.cs.usfca.edu_galles_visualization_Algorithms.html]: https://www.cs.usfca.edu/~galles/visualization/Algorithms.html
[Stack_ Array Implementation]: https://www.cs.usfca.edu/~galles/visualization/StackArray.html
[Stack_ Linked List Implementation]: https://www.cs.usfca.edu/~galles/visualization/StackLL.html
[Queues_ Array Implementation]: https://www.cs.usfca.edu/~galles/visualization/QueueArray.html
[Queues_ Linked List Implementation]: https://www.cs.usfca.edu/~galles/visualization/QueueLL.html
[java]: https://www.cs.usfca.edu/~galles/visualization/java/visualization.html
[Factorial]: https://www.cs.usfca.edu/~galles/visualization/RecFact.html
[Reversing a String]: https://www.cs.usfca.edu/~galles/visualization/RecReverse.html
[N-Queens Problem]: https://www.cs.usfca.edu/~galles/visualization/RecQueens.html
[Binary and Linear Search _of sorted list]: https://www.cs.usfca.edu/~galles/visualization/Search.html
[Binary Search Trees]: https://www.cs.usfca.edu/~galles/visualization/BST.html
[AVL Trees _Balanced binary search trees]: https://www.cs.usfca.edu/~galles/visualization/AVLtree.html
[Red-Black Trees]: https://www.cs.usfca.edu/~galles/visualization/RedBlack.html
[Splay Trees]: https://www.cs.usfca.edu/~galles/visualization/SplayTree.html
[Open Hash Tables _Closed Addressing]: https://www.cs.usfca.edu/~galles/visualization/OpenHash.html
[Closed Hash Tables _Open Addressing]: https://www.cs.usfca.edu/~galles/visualization/ClosedHash.html
[Closed Hash Tables_ using buckets]: https://www.cs.usfca.edu/~galles/visualization/ClosedHashBucket.html
[Trie _Prefix Tree_ 26-ary Tree]: https://www.cs.usfca.edu/~galles/visualization/Trie.html
[Radix Tree _Compact Trie]: https://www.cs.usfca.edu/~galles/visualization/RadixTree.html
[Ternary Search Tree _Trie with BST of children]: https://www.cs.usfca.edu/~galles/visualization/TST.html
[B Trees]: https://www.cs.usfca.edu/~galles/visualization/BTree.html
[B_ Trees]: https://www.cs.usfca.edu/~galles/visualization/BPlusTree.html
[Comparison Sorting]: https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html
[Bucket Sort]: https://www.cs.usfca.edu/~galles/visualization/BucketSort.html
[Counting Sort]: https://www.cs.usfca.edu/~galles/visualization/CountingSort.html
[Radix Sort]: https://www.cs.usfca.edu/~galles/visualization/RadixSort.html
[Heap Sort]: https://www.cs.usfca.edu/~galles/visualization/HeapSort.html
[Heaps]: https://www.cs.usfca.edu/~galles/visualization/Heap.html
[Binomial Queues]: https://www.cs.usfca.edu/~galles/visualization/BinomialQueue.html
[Fibonacci Heaps]: https://www.cs.usfca.edu/~galles/visualization/FibonacciHeap.html
[Leftist Heaps]: https://www.cs.usfca.edu/~galles/visualization/LeftistHeap.html
[Skew Heaps]: https://www.cs.usfca.edu/~galles/visualization/SkewHeap.html
[Breadth-First Search]: https://www.cs.usfca.edu/~galles/visualization/BFS.html
[Depth-First Search]: https://www.cs.usfca.edu/~galles/visualization/DFS.html
[Connected Components]: https://www.cs.usfca.edu/~galles/visualization/ConnectedComponent.html
[Dijkstra_s Shortest Path]: https://www.cs.usfca.edu/~galles/visualization/Dijkstra.html
[Prim_s Minimum Cost Spanning Tree]: https://www.cs.usfca.edu/~galles/visualization/Prim.html
[Topological Sort _Using Indegree array]: https://www.cs.usfca.edu/~galles/visualization/TopoSortIndegree.html
[Topological Sort _Using DFS]: https://www.cs.usfca.edu/~galles/visualization/TopoSortDFS.html
[Floyd-Warshall _all pairs shortest paths]: https://www.cs.usfca.edu/~galles/visualization/Floyd.html
[Kruskal Minimum Cost Spanning Tree Algorithm]: https://www.cs.usfca.edu/~galles/visualization/Kruskal.html
[Calculating nth Fibonacci number]: https://www.cs.usfca.edu/~galles/visualization/DPFib.html
[Making Change]: https://www.cs.usfca.edu/~galles/visualization/DPChange.html
[Longest Common Subsequence]: https://www.cs.usfca.edu/~galles/visualization/DPLCS.html
[2D Rotation and Scale Matrices]: https://www.cs.usfca.edu/~galles/visualization/RotateScale2D.html
[2D Rotation and Translation Matrices]: https://www.cs.usfca.edu/~galles/visualization/RotateTranslate2D.html
[2D Changing Coordinate Systems]: https://www.cs.usfca.edu/~galles/visualization/ChangingCoordinates2D.html
[3D Rotation and Scale Matrices]: https://www.cs.usfca.edu/~galles/visualization/RotateScale3D.html
[3D Changing Coordinate Systems]: https://www.cs.usfca.edu/~galles/visualization/ChangingCoordinates3D.html
[Disjoint Sets]: https://www.cs.usfca.edu/~galles/visualization/DisjointSets.html