Implementing Graph Algorithms Using Scala
- 4.2
-
![]()
![]()
![]()
![]()
Brief Introduction
Learn functional programming in Scala by implementing various graph algorithms.Description
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.
About the author
James Cutajar is a software developer with interests in scalable, high-performance computing and distributed algorithms. He is also an open source contributor, author, blogger, and tech evangelist. When he is not writing software, he is riding his motorbike, surfing, or flying light aircraft. He was born in Malta, lived for almost a decade in London, and is now working in Portugal.
Requirements
- Requirements
- Should have intermediate experience in Scala.
Packt Publishing
4.2 Raiting
Learning Path: Data Science With Apache Spark 2
- 3.6
-
![]()
![]()
![]()
![]()
![]()
Get started with Spark for large-scale distributed data processing and data science Sounds interesting? Let’s see how easy it is! We then develop a real-world Spark application....
Advanced Data Structures and Algorithms in Java
- 4.4
-
![]()
![]()
![]()
![]()
![]()
Advanced Data Structures and Algorithms in Java using Data Structures Algorithms with Java Algorithms Design Analysis Dijkstra’s Shortest Path Algorithm, Prim's Algorithm and Kruskal's Algorithm for minimum spanning tree...
Advanced Data Structures and Algorithms in C#
- 4.1
-
![]()
![]()
![]()
![]()
![]()
Advanced Data Structures and Algorithms in C# using Data structures Algorithms with C# Data Structures Design Analysis Dijkstra’s Shortest Path Algorithm, Prim's Algorithm and Kruskal's Algorithm for minimum spanning tree...
Advanced Data Structures in Java
- 4.8
-
![]()
![]()
![]()
![]()
![]()
How does Google Maps plan the best route for getting around town given current traffic conditions? How does an internet router forward packets of network traffic to minimize delay?...
