This is the code repository for Implementing Graph Algorithms Using Scala [Integrated Course], published by Packt. It contains all the supporting project files necessary to work through the video course from start to finish.
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 practise many functional techniques by solving various graph problems. We start by looking at how we can represent graph structures in an efficient functional manner. Then we explore both the breadth and depth first search graph traversal techniques. Later we use this techniques to show how they can be used for topological sorting and cycle detection. In this course we also describe more complex algorithms such as finding the shortest path and maximal flow networks. All of these solutions are illustrated with easy to understand diagrams and animations. Special care is taken when writing solution so that the principles of functional programming are followed.
By the end of the course, you will be well-versed in all the functional concepts of Scala and you will have refreshed your knowledge of graph algorithms.
- Understand adjacency list and matrix representation
- Learn BFS vs DFS graph traversal and the implemented in a functional manner
- Implement a topological sort algorithm
- Discover how to implement a cycle detection in graphs.
- Understand and develop the existing Dijkstra's shortest path algorithm,
- Understand what is max flow in a flow network and implement the Ford-Fulkerson method and the Edmonds-Karp algorithm
To fully benefit from the coverage included in this course, you will need:
Basic Knowledge of Scala
This course has the following software requirements:
Mac/Linux/Windows OS
IDE such as Intellij or Eclipse
If you have already purchased a print or Kindle version of this book, you can get a DRM-free PDF version at no cost.
Simply click on the link to claim your free PDF.