# Algorithm_and_data_structure **Repository Path**: wangzy0327/Algorithm_and_data_structure ## Basic Information - **Project Name**: Algorithm_and_data_structure - **Description**: No description available - **Primary Language**: C++ - **License**: Not specified - **Default Branch**: main - **Homepage**: None - **GVP Project**: No ## Statistics - **Stars**: 0 - **Forks**: 0 - **Created**: 2021-05-04 - **Last Updated**: 2021-05-04 ## Categories & Tags **Categories**: Uncategorized **Tags**: None ## README ## 整理imooc 数据结构与算法课程 ## 课程源码目录 | **第一章 当我们谈论算法的时候，我们在谈论什么？** | [无代码] | | | :----------------------------------------------------------- | :----------------------------------------------------------: | :----------------------------------------------------------: | | 1-1 我们究竟为什么要学习算法 | [无代码] | | | 1-2 课程介绍 | [无代码] | | | **第二章 排序基础** | [章节C++源码](/02-Sorting-Basic/Course%20Code%20(C++)) | [章节Java源码](/02-Sorting-Basic/Course%20Code%20(Java)) | | 2-1 选择排序 - Selection Sort | [C++源码](/02-Sorting-Basic/Course%20Code%20(C%2B%2B)/01-Selection-Sort) | [Java源码](/02-Sorting-Basic/Course%20Code%20(Java)/01-Selection-Sort/src/bobo/algo) | | 2-2 使用模板（泛型）编写算法 | [C++源码](/02-Sorting-Basic/Course%20Code%20(C%2B%2B)/02-Selection-Sort-Using-Template) | [Java源码](/02-Sorting-Basic/Course%20Code%20(Java)/02-Selection-Sort-Using-Comparable/src/bobo/algo) | | 2-3 随机生成算法测试用例 | [C++源码](/02-Sorting-Basic/Course%20Code%20(C%2B%2B)/03-Selection-Sort-Generate-Test-Cases) | [Java源码](https://github.com/liuyubobobo/Play-with-Algorithms/blob/master/02-Sorting-Basic/Course%20Code%20(Java)/03-Selection-Sort-Generate-Test-Cases/src/bobo/algo/SortTestHelper.java) | | 2-4 测试算法的性能 | [C++源码](/02-Sorting-Basic/Course%20Code%20(C%2B%2B)/04-Selection-Sort-Detect-Performance) | [Java源码](/02-Sorting-Basic/Course%20Code%20(Java)/04-Selection-Sort-Detect-Performance/src/bobo/algo) | | 2-5 插入排序法 - Insertion Sort | [C++源码](/02-Sorting-Basic/Course%20Code%20(C%2B%2B)/05-Insertion-Sort) | [Java源码](/02-Sorting-Basic/Course%20Code%20(Java)/05-Insertion-Sort/src/bobo/algo) | | 2-6 插入排序法的改进 | [C++源码](/02-Sorting-Basic/Course%20Code%20(C%2B%2B)/06-Insertion-Sort-Advance) | [Java源码](/02-Sorting-Basic/Course%20Code%20(Java)/06-Insertion-Sort-Advance/src/bobo/algo) | | 2-7 更多关于O(n^2)排序算法的思考 | [无代码] | | | 本章课程最终代码 | [C++源码](/02-Sorting-Basic/Course%20Code%20(C%2B%2B)/Chapter-02-Completed-Code) | [Java源码](/02-Sorting-Basic/Course%20Code%20(Java)/Chapter-02-Completed-Code/src/bobo/algo) | | 补充1 选择排序算法的优化 | [C++源码](02-Sorting-Basic/Course%20Code%20(C%2B%2B)/Optional-01-Optimized-Selection-Sort/) | [Java源码](02-Sorting-Basic/Course%20Code%20(Java)/Optional-01-Optimized-Selection-Sort/src/bobo/algo/) | | 补充2 冒泡排序法 - Bubble Sort | [C++源码](/02-Sorting-Basic/Course%20Code%20(C%2B%2B)/Optional-02-Bubble-Sort) | [Java源码](/02-Sorting-Basic/Course%20Code%20(Java)/Optional-02-Bubble-Sort/src/bobo/algo) | | 补充3 希尔排序法 - Shell Sort | [C++源码](/02-Sorting-Basic/Course%20Code%20(C%2B%2B)/Optional-03-Shell-Sort) | [Java源码](/02-Sorting-Basic/Course%20Code%20(Java)/Optional-03-Shell-Sort/src/bobo/algo) | | 补充4 选择排序算法可视化 (Java) | [看得见的算法](http://coding.imooc.com/class/138.html) | [第四章1，2小节](http://coding.imooc.com/lesson/138.html#mid=7082) | | 补充5 插入排序算法可视化 (Java) | [看得见的算法](http://coding.imooc.com/class/138.html) | [第四章3，4小节](http://coding.imooc.com/lesson/138.html#mid=7084) | | **第三章 高级排序算法** | [章节C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)) | [章节Java源码](/03-Sorting-Advance/Course%20Code%20(Java)) | | 3-1 归并排序法 - Merge Sort | [无代码] | | | 3-2 归并排序法的实现 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/02-Merge-Sort) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/02-Merge-Sort/src/bobo/algo) | | 3-3 归并排序法的优化 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/03-Merge-Sort-Advance) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/03-Merge-Sort-Advance/src/bobo/algo) | | 3-4 自底向上的归并排序算法 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/04-Merge-Sort-Bottom-Up) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/04-Merge-Sort-Bottom-Up/src/bobo/algo) | | 3-5 快速排序法 - Quick Sort | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/05-Quick-Sort) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/05-Quick-Sort/src/bobo/algo) | | 3-6 随机化快速排序法 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/06-Quick-Sort-Deal-With-Nearly-Ordered-Array) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/06-Quick-Sort-Deal-With-Nearly-Ordered-Array/src/bobo/algo) | | 3-7 双路快速排序法 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/07-Quick-Sort-Deal-With-Identical-Keys) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/07-Quick-Sort-Deal-With-Identical-Keys/src/bobo/algo) | | 3-8 三路快速排序法 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/08-Quick-Sort-Three-Ways) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/08-Quick-Sort-Three-Ways/src/bobo/algo) | | 3-9 归并排序和快速排序的衍生问题 | [无代码] | | | 本章课程最终代码 | [C++源码]() | [Java源码]() | | 补充1 归并排序的另外一个优化，在merge外申请aux空间 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/Optional-01-MergeSort-Create-aux-Array-Out-of-Merge) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/Optional-01-Merge-Sort-Create-aux-Array-Out-of-Merge/src/bobo/algo) | | 补充2 自顶向下和自底向上的归并排序的比较 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/Optional-02-MergeSort-and-MergeSortBU-Perfermance-Comparison) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/Optional-02-MergeSort-and-MergeSortBU-Performance-Comparison/src/bobo/algo) | | 补充3 ShellSort, MergeSort 和 QuickSort 的比较 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/Optional-03-ShellSort-MergeSort-and-QuickSort-Comparision) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/Optional-03-ShellSort-MergeSort-and-QuickSort-Comparison/src/bobo/algo) | | 补充4 归并排序算法可视化 (Java) | [看得见的算法](http://coding.imooc.com/class/138.html) | [第四章5，6小节](http://coding.imooc.com/lesson/138.html#mid=7086) | | 补充5 快速排序算法可视化 (Java) | [看得见的算法](http://coding.imooc.com/class/138.html) | [第四章7-10小节](http://coding.imooc.com/lesson/138.html#mid=7088) | | 补充6 归并排序思路求逆序数 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/Optional-04-Inversion-Number) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/Optional-04-Inversion-Number/src/bobo/algo) | | 补充7 求任意数组第k小（大）的值 | [C++源码](/03-Sorting-Advance/Course%20Code%20(C%2B%2B)/Optional-05-Selection) | [Java源码](/03-Sorting-Advance/Course%20Code%20(Java)/Optional-05-Selection/src/bobo/algo) | | 补充8 对链表的O(nlogn)级别的排序 | [整理中] | [敬请期待] | | 补充9 更多归并排序优化思想的实验 | [整理中] | [敬请期待] | | 补充10 更多快速排序优化思想的实验 | [整理中] | [敬请期待] | | **第四章 堆和堆排序** | [章节C++源码](/04-Heap/Course%20Code%20(C%2B%2B)) | [章节Java源码](/04-Heap/Course%20Code%20(Java)) | | 4-1 为什么使用堆 | [无代码] | | | 4-2 堆的基本存储 | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/02-Max-Heap-Class-Basic) | [Java源码](/04-Heap/Course%20Code%20(Java)/02-Max-Heap-Class-Basic/src/bobo/algo) | | 4-3 Shift Up | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/03-Shift-Up) | [Java源码](/04-Heap/Course%20Code%20(Java)/03-Shift-Up/src/bobo/algo) | | 4-4 Shift Down | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/04-Shift-Down) | [Java源码](/04-Heap/Course%20Code%20(Java)/04-Shift-Down/src/bobo/algo) | | 4-5 基础堆排序和Heapify | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/05-Heapify) | [Java源码](/04-Heap/Course%20Code%20(Java)/05-Heapify/src/bobo/algo) | | 4-6 优化的堆排序 - Heap Sort | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/06-Heap-Sort) | [Java源码](/04-Heap/Course%20Code%20(Java)/06-Heap-Sort/src/bobo/algo) | | 4-7 排序算法总结 | [无代码] | | | 4-8 索引堆 - Index Heap | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/08-Index-Heap) | [Java源码](/04-Heap/Course%20Code%20(Java)/08-Index-Heap/src/bobo/algo) | | 4-9 索引堆的优化 | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/09-Index-Heap-Advance) | [Java源码](/04-Heap/Course%20Code%20(Java)/09-Index-Heap-Advance/src/bobo/algo) | | 4-10 和堆相关的其他问题 | [无代码] | | | 本章课程最终代码 | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/Chapter-04-Completed-Code) | [Java源码](/04-Heap/Course%20Code%20(Java)/Chapter-04-Completed-Code/src/bobo/algo) | | 补充1 优化的Shift Up和Shift Down | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/Optional-1-Optimized-Shift-Up-and-Shift-Down) | [Java源码](/04-Heap/Course%20Code%20(Java)/Optional-1-Optimized-Shift-Up-and-Shift-Down/src/bobo/algo) | | 补充2 最小堆 | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/Optional-2-Min-Heap) | [Java源码](/04-Heap/Course%20Code%20(Java)/Optional-2-Min-Heap/src/bobo/algo) | | 补充3 最小索引堆 | [C++源码](/04-Heap/Course%20Code%20(C%2B%2B)/Optional-3-Index-Min-Heap) | [Java源码](/04-Heap/Course%20Code%20(Java)/Optional-3-Index-Min-Heap/src/bobo/algo) | | 补充4 从0开始索引的最大堆和最小堆 | [玩转数据结构](https://coding.imooc.com/class/207.html) | [第八章](https://coding.imooc.com/lesson/207.html#mid=13738) | | 补充5 从0开始索引的最大索引堆和最小索引堆 | [整理中] | [敬请期待] | | 补充6 堆排序可视化 (Java) | [看得见的算法](http://coding.imooc.com/class/138.html) | [第四章第11小节](http://coding.imooc.com/lesson/138.html#mid=7092) | | 补充7 可以空间动态扩展的堆结构 | [玩转数据结构](https://coding.imooc.com/class/207.html) | [第八章](https://coding.imooc.com/lesson/207.html#mid=13738) | | 补充8 N个元素中的前M大(或小)元素 | [玩转数据结构](https://coding.imooc.com/class/207.html) | [第八章 7，8小节](https://coding.imooc.com/lesson/207.html#mid=13744) | | 补充9 双向优先队列 | [整理中] | [敬请期待] | | 补充10 多叉堆 | [整理中] | [敬请期待] | | 补充11 斐波那契额堆 | [整理中] | [敬请期待] | | 补充12 索引排序 | [整理中] | [敬请期待] | | 补充13 添加索引，不稳定排序转换成稳定排序 | [整理中] | [敬请期待] | | 补充14 基于事件堆的例子碰撞检测 (Java) | [整理中] | [敬请期待] | | **第五章 二分搜索树** | [章节C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)) | [章节Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)) | | 5-1 二分查找法（Binary Search） | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/01-Binary-Search) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/01-Binary-Search/src/bobo/algo) | | 5-2 二分搜索树基础（Binary Search Tree） | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/02-Binary-Search-Tree-Basics) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/02-Binary-Search-Tree-Basics/src/bobo/algo) | | 5-3 二分搜索树的节点插入 | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/03-Binary-Search-Tree-Insert) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/03-Binary-Search-Tree-Insert/src/bobo/algo) | | 5-4 二分搜索树的查找 | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/04-Binary-Search-Tree-Search) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/04-Binary-Search-Tree-Search/src/bobo/algo) | | 5-5 二分搜索树的遍历（深度优先遍历） | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/05-Binary-Search-Tree-Traverse) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/05-Binary-Search-Tree-Traverse/src/bobo/algo) | | 5-6 层序遍历（广度优先遍历） | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/06-Binary-Search-Tree-Level-Traverse) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/06-Binary-Search-Tree-Level-Traverse/src/bobo/algo) | | 5-7 删除最大值，最小值 | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/07-Binary-Search-Tree-Remove-Min-and-Max) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/07-Binary-Search-Tree-Remove-Min-and-Max/src/bobo/algo) | | 5-8 二分搜索树节点的删除（Hubbard Deletion） | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/08-Binary-Search-Tree-Remove) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/08-Binary-Search-Tree-Remove/src/bobo/algo) | | 5-9 二分搜索树的顺序性 | [无代码] | | | 5-10 二分搜索树的局限性 | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/10-The-Disadvantages-of-Binary-Search-Tree-and-More-Trees) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/10-The-Disadvantages-of-Binary-Search-Tree-and-More-Trees/src/bobo/algo) | | 5-11 树形问题和更多树 | [无代码] | | | 本章课程最终代码 | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Chapter-05-Completed-Code) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/Chapter-05-Completed-Code/src/bobo/algo) | | 补充1 二分查找法改变变量定义，论如何写出正确算法 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第三章1，2小节](http://coding.imooc.com/lesson/82.html#mid=2656) | | 补充2 二分搜索法的floor和ceil | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-02-Floor-and-Ceil-in-Binary-Search) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-02-Floor-and-Ceil-in-Binary-Search/src/bobo/algo/) | | 补充3 二分搜索法的lower bound和upper bound | [C++源码](05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-03-Lower-Bound-and-Upper-Bound-in-Binary-Search/) | [Java源码](05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-03-Lower-Bound-and-Upper-Bound-in-Binary-Search/src/) | | 补充4 二分搜索的总结 | [C++源码](05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-04-More-about-Binary-Search/) | [Java源码](05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-04-More-about-Binary-Search/src/) | | 补充5 二分搜索树中的floor和ceil | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-05-Floor-and-Ceil-in-BST/) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-05-Floor-and-Ceil-in-BST/src/bobo/algo/) | | 补充6 二分搜索树中的前驱和后继 | [C++源码](/05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-06-Predecessor-and-Successor-in-BST/) | [Java源码](/05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-06-Predecessor-and-Successor-in-BST/src/bobo/algo/) | | 补充7 二分搜索树中的rank和select | [整理中] | [敬请期待] | | 补充8 二分搜索树前中后序非递归遍历
深入理解非递归和递归的区别，以及非递归和栈的关系 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第六章2，3小节](http://coding.imooc.com/lesson/82.html#mid=2675) | | 补充9 二叉树前中后序遍历的经典非递归实现 | [C++](05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-09-Binary-Tree-Classic-Nonrecursive-Traversal/) | [Java](05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-09-Binary-Tree-Classic-Nonrecursive-Traversal/) | | 补充10 二叉树的Morris前中后序遍历 | [C++](05-Binary-Search-Tree/Course%20Code%20(C%2B%2B)/Optional-10-Binary-Tree-Morris-Traversal/) | [Java](05-Binary-Search-Tree/Course%20Code%20(Java)/Optional-10-Binary-Tree-Morris-Traversal/src/) | | 补充11 二分搜索树整体的非递归实现 | [整理中] | [敬请期待] | | 补充12 二分搜索树的另一个应用：Tree Set | [玩转数据结构](https://coding.imooc.com/class/207.html) | [第六章，第七章](https://coding.imooc.com/lesson/207.html#mid=13454) | | 补充13 允许重复键值的二分搜索树：Multi Tree Set / Map | [整理中] | [敬请期待] | | 补充14 更多二分搜索树（或者二叉树）相关的面试问题 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第七章](http://coding.imooc.com/lesson/82.html#mid=2681) | | 补充15 二叉树的公共祖先 (LCA) | [整理中] | [敬请期待] | | 补充16 树形问题和回溯法 | [玩转算法面试](http://coding.imooc.com/class/82.html) | [第八章](http://coding.imooc.com/lesson/82.html#mid=2687) | | 补充17 树形问题之八皇后问题 | [玩转算法面试](http://coding.imooc.com/class/82.html#Anchor) | [第八章第8小节](http://coding.imooc.com/lesson/82.html#mid=2695) | | 补充18 走迷宫 (Java) | [看得见的算法](http://coding.imooc.com/class/138.html) | [第五章](http://coding.imooc.com/lesson/138.html#mid=7064) | | 补充19 树形问题之 Move the Box 求解 (Java) | [看得见的算法](http://coding.imooc.com/class/138.html) | [第八章](http://coding.imooc.com/lesson/138.html#mid=7440) | | 补充20 线段树 (区间树) | [玩转数据结构](https://coding.imooc.com/class/207.html) | [第九章](https://coding.imooc.com/lesson/207.html#mid=13843) | | 补充21 Trie | [玩转数据结构](https://coding.imooc.com/class/207.html) | [第十章](https://coding.imooc.com/lesson/207.html#mid=13850) | | 补充22 KD树 | [整理中] | [敬请期待] | | 补充23 哈夫曼树 | [整理中] | [敬请期待] | | 补充24 使用哈夫曼树进行文件压缩 | [整理中] | [敬请期待] | | 补充25 AVL树 | [玩转数据结构](https://coding.imooc.com/class/207.html) | [第十二章](https://coding.imooc.com/lesson/207.html#mid=14346) | | 补充26 红黑树 | [玩转数据结构](https://coding.imooc.com/class/207.html) | [第十三章] | | 补充27 伸展树 | [整理中] | [敬请期待] | | 补充28 B类树 | [玩转数据结构](https://coding.imooc.com/class/207.html) | [第十六章] | | 补充29 Treap | [整理中] | [敬请期待] | | 补充30 树形问题之数独求解 | [整理中] | [敬请期待] | | 补充31 数独求解之特殊数据结构 | [整理中] | [敬请期待] | | 补充32 树形问题之八数码问题 (A*算法初步) | [整理中] | [敬请期待] | | 补充33 树形问题之推箱子自动求解 | [整理中] | [敬请期待] | | **第六章 并查集** | [章节C++源码](/06-Union-Find/Course%20Code%20(C%2B%2B)) | [章节Java源码](/06-Union-Find/Course%20Code%20(Java)) | | 6-1 并查集基础（Union Find） | [无代码] | | | 6-2 Quick Find | [C++源码](/06-Union-Find/Course%20Code%20(C%2B%2B)/02-Quick-Find) | [Java源码](/06-Union-Find/Course%20Code%20(Java)/02-Quick-Find/src/bobo/algo) | | 6-3 Quick Union | [C++源码](/06-Union-Find/Course%20Code%20(C%2B%2B)/03-Quick-Union) | [Java源码](/06-Union-Find/Course%20Code%20(Java)/03-Quick-Union/src/bobo/algo) | | 6-4 基于size的优化 | [C++源码](/06-Union-Find/Course%20Code%20(C%2B%2B)/04-Optimize-by-Size) | [Java源码](/06-Union-Find/Course%20Code%20(Java)/04-Optimize-by-Size/src/bobo/algo) | | 6-5 基于rank的优化 | [C++源码](/06-Union-Find/Course%20Code%20(C%2B%2B)/05-Optimize-by-Rank) | [Java源码](/06-Union-Find/Course%20Code%20(Java)/05-Optimize-by-Rank/src/bobo/algo) | | 6-6 路径压缩（Path Compression） | [C++源码](/06-Union-Find/Course%20Code%20(C%2B%2B)/06-Path-Compression) | [Java源码](/06-Union-Find/Course%20Code%20(Java)/06-Path-Compression/src/bobo/algo) | | 本章课程最终代码 | [C++源码](/06-Union-Find/Course%20Code%20(C%2B%2B)/Chapter-06-Completed-Code) | [Java源码](/06-Union-Find/Course%20Code%20(Java)/Chapter-06-Completed-Code/src/bobo/algo) | | 补充1 使用相同的测试用例测试不同的UF实现 | [C++源码](/06-Union-Find/Course%20Code%20(C%2B%2B)/Optional-01-Same-Cases-Test-for-UF) | [Java源码](/06-Union-Find/Course%20Code%20(Java)/Optional-01-Same-Cases-Test-for-UF/src/bobo/algo) | | 补充2 迭代和递归实现两种路径压缩的区别 | [C++源码](/06-Union-Find/Course%20Code%20(C%2B%2B)/Optional-02-Path-Compression-Comparison) | [Java源码](/06-Union-Find/Course%20Code%20(Java)/Optional-02-Path-Compression-Comparison/src/bobo/algo) | | **第七章 图的基础** | [章节C++源码](/07-Graph-Basics/Course%20Code%20(C%2B%2B)) | [章节Java源码](/07-Graph-Basics/Course%20Code%20(Java)) | | 7-1 图论基础 | [无代码] | | | 7-2 图的表示 | [C++源码](/07-Graph-Basics/Course%20Code%20(C%2B%2B)/02-Graph-Representation) | [Java源码](/07-Graph-Basics/Course%20Code%20(Java)/02-Graph-Representation/src/bobo/algo) | | 7-3 相邻节点迭代器 | [C++源码](/07-Graph-Basics/Course%20Code%20(C%2B%2B)/03-Vertex%20Adjacent%20Iterator) | [Java源码](/07-Graph-Basics/Course%20Code%20(Java)/03-Vertex-Adjacent-Iterator/src/bobo/algo) | | 7-4 图的算法框架 | [C++源码](/07-Graph-Basics/Course%20Code%20(C%2B%2B)/04-Read-Graph) | [Java源码](/07-Graph-Basics/Course%20Code%20(Java)/04-Read-Graph/src/bobo/algo) | | 7-5 深度优先遍历和联通分量 | [C++源码](/07-Graph-Basics/Course%20Code%20(C%2B%2B)/05-DFS-and-Components) | [Java源码](/07-Graph-Basics/Course%20Code%20(Java)/05-DFS-and-Components/src/bobo/algo) | | 7-6 寻路 | [C++源码](/07-Graph-Basics/Course%20Code%20(C%2B%2B)/06-Finding-a-Path) | [Java源码](/07-Graph-Basics/Course%20Code%20(Java)/06-Finding-a-Path/src/bobo/algo) | | 7-7 广度优先遍历和无权图的最短路径 | [C++源码](/07-Graph-Basics/Course%20Code%20(C%2B%2B)/07-BFS-and-Shortest-Path) | [Java源码](/07-Graph-Basics/Course%20Code%20(Java)/07-BFS-and-Shortest-Path/src/bobo/algo) | | 7-8 迷宫生成，PS抠图 —— 更多无权图的应用 | [无代码] | | | 本章课程最终代码 | [C++源码](/07-Graph-Basics/Course%20Code%20(C%2B%2B)/Chapter-07-Completed-Code) | [Java源码](/07-Graph-Basics/Course%20Code%20(Java)/Chapter-07-Completed-Code/src/bobo/algo) | | 补充1 Floodfill算法练习题 | [玩转算法面试](http://coding.imooc.com/class/82.html#Anchor) | [第八章第7小节](http://coding.imooc.com/lesson/82.html#mid=2694) | | 补充2 Floodfill算法可视化 (Java) | [整理中] | [敬请期待] | | 补充3 扫雷游戏模型 | [看得见的算法](http://coding.imooc.com/class/138.html) | [第七章](http://coding.imooc.com/lesson/138.html#mid=7266) | | 补充4 随机迷宫生成 | [看得见的算法](http://coding.imooc.com/class/138.html) | [第六章](http://coding.imooc.com/lesson/138.html#mid=7073) | | 补充5 欧拉路径 | [整理中] | [敬请期待] | | 补充6 哈密尔顿路径 | [整理中] | [敬请期待] | | 补充7 Blue Path 自动求解 | [整理中] | [敬请期待] | | 补充8 地图填色问题 | [整理中] | [敬请期待] | | 补充9 二分图和二分图的最有匹配 | [整理中] | [敬请期待] | | 补充10 墙为线条的迷宫生成 | [整理中] | [敬请期待] | | 补充11 六边形的迷宫生成 | [整理中] | [敬请期待] | | 补充12 TSP问题 | [整理中] | [敬请期待] | | 补充13 TSP问题之遗传算法初步 | [整理中] | [敬请期待] | | **第八章 最小生成树** | [章节C++源码](/08-Minimum-Span-Trees/Course%20Code%20(C%2B%2B)) | [章节Java源码](/08-Minimum-Span-Trees/Course%20Code%20(Java)) | | 8-1 有权图 | [C++源码](/08-Minimum-Span-Trees/Course%20Code%20(C%2B%2B)/01-Weighted-Graph) | [Java源码](/08-Minimum-Span-Trees/Course%20Code%20(Java)/01-Weighted-Graph) | | 8-2 最小生成树问题和切分定理 | [无代码] | | | 8-3 Prim算法的第一个实现 (Lazy Prim) | [C++源码](/08-Minimum-Span-Trees/Course%20Code%20(C%2B%2B)/03-Lazy-Prim) | [Java源码](/08-Minimum-Span-Trees/Course%20Code%20(Java)/03-Lazy-Prim/src/bobo/algo) | | 8-4 Prim算法的优化 | [无代码] | | | 8-5 优化后的Prim算法的实现 | [C++源码](/08-Minimum-Span-Trees/Course%20Code%20(C%2B%2B)/05-Implementation-of-Optimized-Prim-Algorithm) | [Java源码](/08-Minimum-Span-Trees/Course%20Code%20(Java)/05-Implementation-of-Optimized-Prim-Algorithm/src/bobo/algo) | | 8-6 Kruskal算法 | [C++源码](/08-Minimum-Span-Trees/Course%20Code%20(C%2B%2B)/06-Kruskal-Algorithm) | [Java源码](/08-Minimum-Span-Trees/Course%20Code%20(Java)/06-Kruskal-Algorithm/src/bobo/algo) | | 8-7 最小生成树算法的思考 | [无代码] | | | 本章课程最终代码 | [C++源码](/08-Minimum-Span-Trees/Course%20Code%20(C%2B%2B)/Chapter-08-Completed-Code) | [Java源码](/08-Minimum-Span-Trees/Course%20Code%20(Java)/Chapter-08-Completed-Code/src/bobo/algo) | | 补充1 Prim算法可视化 (Java) | [整理中] | [敬请期待] | | 补充2 Kruskal算法可视化 (Java) | [整理中] | [敬请期待] | | 补充3 图的最小生成树的个数 | [整理中] | [敬请期待] | | 补充4 Vyssotsky Algorithm | [整理中] | [敬请期待] | | **第九章 最短路径** | [章节C++源码](/09-Shortest-Path/Course%20Code%20(C%2B%2B)) | [章节Java源码](/09-Shortest-Path/Course%20Code%20(Java)) | | 9-1 最短路径问题和松弛操作(Relaxation) | [无代码] | | | 9-2 Dijkstra的算法思想 | [无代码] | | | 9-3 实现Dijkstra算法 | [C++源码](/09-Shortest-Path/Course%20Code%20(C%2B%2B)/03-Implementation-of-Dijkstra) | [Java源码](/09-Shortest-Path/Course%20Code%20(Java)/03-Implementation-of-Dijkstra) | | 9-4 负权边和Bellman-Ford算法 | [无代码] | | | 9-5 实现Bellman-Ford算法 | [C++源码](/09-Shortest-Path/Course%20Code%20(C%2B%2B)/05-Implementation-of-Bellman-Ford) | [Java源码](/09-Shortest-Path/Course%20Code%20(Java)/05-Implementation-of-Bellman-Ford) | | 9-6 更多和最短路径相关的思考 | [无代码] | | | 本章课程最终代码 | [C++源码](/09-Shortest-Path/Course%20Code%20(C%2B%2B)/Chapter-09-Completed-Code) | [Java源码](/09-Shortest-Path/Course%20Code%20(Java)/Chapter-09-Completed-Code) | | 补充1 基于最小堆的 Dijkstra 实现 | [C++源码](/09-Shortest-Path/Course%20Code%20(C%2B%2B)/Optional-1-Dijkstra-based-on-Min-Heap/) | [敬请期待] | | 补充2 SPFA算法 | [整理中] | [敬请期待] | | 补充3 有向无环图（DAG）的拓扑排序 | [整理中] | [敬请期待] | | 补充4 Floyed算法 | [整理中] | [敬请期待] | | 补充5 使用Bellman-Ford求最长路径 | [整理中] | [敬请期待] | | 补充6 使用拓扑排序求有向无环图（DAG）的最长路径 | [整理中] | [敬请期待] | | 补充7 使用Floyed算法求所有对的最长路径 | [整理中] | [敬请期待] | | **第十章 结束语** | [无代码] | | | 10-1 总结：算法思想，大家加油！ | [无代码] | |