0:00 Course Introduction
-----------------------------------------------undirected graphs
9:22 Introduction to graphs
18:54 Graph API
33:41 Depth first Search
1:00:03 Breadth First Search
1:13:37 Connected Components
1:32:33 Graph Challenges
--------------------------------------------------------Directed Graphs
1:47:02 Introduction to Digraphs
1:55:32 Digraph API
2:00:28 Digraph Search
2:21:24 Topological Sort
2:34:18 Strong Components
---------------------------------------------------------Minimum Spanning Trees
2:54:40 Introduction to MSTs
2:58:44 Greedy Algorithm
3:11:40 Edge Weighted Graph API
3:22:55 Kruskal's Algorithm
3:35:23 Prim's Algorithm
4:08:38 MST Context
------------------------------------------------------------ Shortest Paths
4:19:12 Shortest Paths APIs
4:30:03 Shortest Path Properties
4:44:49 Dijkstra's Algorithm
5:03:47 Edge Weighted DAGs
5:23:10 Negative Weights
----------------------------------------------------------------------Maximum flow
5:44:11 introduction to maxflow
5:54:44 Ford Fulkerson Algorithm
6:01:16 Maxflow Mincut Theorem
6:10:54 Running time Analysis
6:19:43 Java Implementation
6:34:12 Maxflow Applications
------------------------------------------------------------------------ Radix Sorts
6:56:32 Strings in Java
7:14:15 Key Indexed Counting
7:26:21 LSD Radix Sort
7:41:21 MSD Radix Sort
7:55:02 Way Radix Quicksort
8:02:24 Suffix Arrays
----------------------------------------------------------------------------Tries
8:21:49 R way Tries
8:54:08 Ternary Search Tries
9:16:50 Charactor Based Operations
--------------------------------------------------------------------------------
Recommended Book
▶▶Algorithms By Robert Sedgewick
algorithms part 2
Algorithms part 2 (2/2)
Algorithms part 1
-------------------------------------------------------------------------------------------------------------------------------------
If you realllly enjoy my content, you're welcome to support me and my channel with a small donation via PayPal
Link to PayPal donation