Explore the Bellman-Ford algorithm for finding shortest paths in graphs with negative edge weights, understand its implementation in JavaScript, and learn how it differs from Dijkstra's algorithm.
Explore the concept of Strongly Connected Components (SCCs) in directed graphs, learn Kosaraju's algorithm for identifying SCCs, and apply these concepts to practical problems in JavaScript.