基础排序, 高级排序, 堆, 二分搜索树, 并查集, 图以及图相关算法知识总结

# basic-algorithm ## 基础排序 1. [选择排序](https://github.com/l81893521/basic-algorithm/blob/master/src/main/java/will/zhang/basic/ASelectSort/SelectionSort.java) 2. [使用泛型编写算法](https://github.com/l81893521/basic-algorithm/blob/master/src/main/java/will/zhang/basic/BSelectSortUsingComparable/SelectionSort.java) 3. [测试算法性能](https://github.com/l81893521/basic-algorithm/blob/master/src/main/java/will/zhang/basic/DSelectionSortDetectPerformance/SelectionSort.java) 4. [插入排序](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/basic/EInsertionSort) 5. [插入排序改进](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/basic/FInsertionSort) ## 高级排序算法 1. [归并排序](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/advance/AMergeSort) 2. [归并排序改进](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/advance/BMergeSortAdvance) 3. [归并排序自底向上](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/advance/CMergeSortBottomUp) 4. [快速排序](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/advance/DQuickSort) 5. [随机化快速排序](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/advance/EQuickSortDealWithNearOrderedArray) 6. [双路快速排序](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/advance/FQuickSort2Ways) 7. [三路快速排序](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/advance/GQuickSort3Ways) ## 堆和堆排序 1. [堆的基本存储](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/heap/AMaxHeapClassBasic) 2. [ShiftUp](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/heap/BShiftUp) 3. [ShiftDown](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/heap/CShiftDown) 4. [基础堆排序和Heapify](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/heap/DHeapify) 5. [优化的堆排序](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/heap/EHeapSort) 6. [索引堆(IndexHeap)](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/heap/FIndexHeap) 7. [索引堆的优化](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/heap/GIndexHeapAdvance) ## 二分搜索树 1. [二分查找法(Binary Search)](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/binarySearchTree/ABinarySearch) 2. [二分搜索树基础](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/binarySearchTree/BBinarySearchTreeBasic) 3. [二分搜索树的节点插入](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/binarySearchTree/CBinarySearchTreeInsert) 4. [二分搜索树的查找](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/binarySearchTree/DBinarySearchTreeSearch) 5. [二分搜索树的遍历(深度优先遍历)](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/binarySearchTree/EBinarySearchTreeTraverse) 6. [层序遍历(广度优先遍历)](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/binarySearchTree/FBinarySearchTreeLevelTraverse) 7. [删除最大值, 最小值](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/binarySearchTree/GBinarySearchTreeRemoveMinAndMax) 8. [二分搜索树节点的删除](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/binarySearchTree/HBinarySearchTreeRemove) 9. [floor和ceil的实现](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/binarySearchTree/IBinarySearchTreeFloorCeil) ## 并查集 1. [Quick Find](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/unionFind/AQuickFind) 2. [Quick Union](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/unionFind/BQuickUnion) 3. [基于size的优化](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/unionFind/COptimizeBySize) 4. [基于rank的优化](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/unionFind/DOptimizeByRank) 5. [路径压缩(Path Compression)](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/unionFind/EPathCompression) ## 图的基础 1. [图的表示(稀疏图和稠密图), 使用邻接表和邻接矩阵](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/unionFind/EPathCompression) 2. [相邻节点迭代器](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/graphBasic/BVertexAdjacentIterator) 3. [图的算法框架](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/graphBasic/CReadGraph) 4. [深度优先遍历和联通分量](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/graphBasic/DDfsAndComponents) 5. [寻路](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/graphBasic/EFindingAPath) 6. [广度优先遍历和最短路径](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/graphBasic/FBFSAndShortestPath) ## 最小生成树 1. [有权图](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/minimumSpanTree/AWeightedGraph) 2. [Prim算法的第一个实现(Lazy Prim)](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/minimumSpanTree/BLazyPrim) 3. [Prim算法的优化](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/minimumSpanTree/COptimizedPrim) 4. [Kruskal算法](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/minimumSpanTree/DKruskalAlgorithm) ## 最短路径 1. [Dijkstra算法](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/shortestPath/ADijkstra) 2. [Bellman-Ford算法](https://github.com/l81893521/basic-algorithm/tree/master/src/main/java/will/zhang/shortestPath/BBellmanFord)