Switch to the store?

Implementing Graph Algorithms Using Scala [Integrated Course]

 Learn 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 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. The code and supporting files for the course are available at https://github.com/PacktPublishing/Implementing-Graph-Algorithms-using-Scala Style and Approach The course starts off with explaining the basic graph algorithms. We discuss each algorithm briefly before proceeding to implement it in Scala. This way, you understand not only the functional implementation, but also the underlying concepts behind the algorithm. 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 3 hours 35 minutes 9781788472364 19 Jul 2018
 Kahn’s Algorithm Kahn’s Implementation DFS for Topological Sorting DFS for Sorting Implementation
 DFS Cycle Detection Algorithm DFS Cycle Implementation Floyd’s Algorithm Floyd’s Implementation
 Dijkstra’s Algorithm Dijkstra’s Implementation