Scala's functional programming features are a boon to help you design “easy to reason about” systems to control growing software complexities.

In this course, we look at graph algorithms. Graph algorithms look at the toughest data structures in computer science. In this course, we will describe how to represent graphs in a more functional manner and present common algorithms. We will begin with representing and traversing graphs, topological sort, cycle detection, shortest flow, and maximum flow. Through these topics, we will talk about graph representation in an immutable manner, BFS and DFS graph traversal, Dijkstra's algorithm, residual networks, and Ford-Fulkerson method.

By the end of the course, you will be well-versed in all the functional concepts of Scala.

Key Features

• Discuss the disadvantages of the imperative approach and compare them with implement the algorithms in a functional manner
• Reinforce your knowledge using assessments and quizzes
• Verify the concepts learned through an end-of-the-course practical project

Who this course is for

This course is aimed at those with a fair amount of experience in Scala. This course will allow developers to understand a number of graph algorithms and show functional ways of implementing the same.