Implementing Graph Algorithms Using Scala

Implementing Graph Algorithms Using Scala, available at $39.99, has an average rating of 4.3, with 26 lectures, based on 33 reviews, and has 231 subscribers.

You will learn about 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 This course is ideal for individuals who are This course is aimed at those with an intermediate experience in Scala. This course will allow developers to understand a number of graph algorithms and show how these algorithms can be implemented functionally. It is particularly useful for This course is aimed at those with an intermediate experience in Scala. This course will allow developers to understand a number of graph algorithms and show how these algorithms can be implemented functionally.

Enroll now: Implementing Graph Algorithms Using Scala

Summary

Title: Implementing Graph Algorithms Using Scala

Price: $39.99

Average Rating: 4.3

Number of Lectures: 26

Number of Published Lectures: 26

Number of Curriculum Items: 26

Number of Published Curriculum Objects: 26

Original Price: $199.99

Quality Status: approved

Status: Live

What You Will 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

Who Should Attend

This course is aimed at those with an intermediate experience in Scala. This course will allow developers to understand a number of graph algorithms and show how these algorithms can be implemented functionally.

Target Audiences

This course is aimed at those with an intermediate experience in Scala. This course will allow developers to understand a number of graph algorithms and show how these algorithms can be implemented functionally.

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.

Course Curriculum

Chapter 1: Graph Structures

Lecture 1: The Course Overview

Lecture 2: Representing Graphs

Lecture 3: Functional Graphs

Lecture 4: Developing Functional Graphs

Chapter 2: Traversing Graphs

Lecture 1: Depth First Search

Lecture 2: Depth First Search Implementation

Lecture 3: Breadth First Search

Lecture 4: Breadth First Search Implementation

Chapter 3: Topological Sorting

Lecture 1: Practical Applications

Lecture 2: Kahn’s Algorithm

Lecture 3: Kahn’s Implementation

Lecture 4: DFS for Topological Sorting

Lecture 5: DFS for Sorting Implementation

Chapter 4: Cycle Detection in Graphs

Lecture 1: Practical Applications

Lecture 2: DFS Cycle Detection Algorithm

Lecture 3: DFS Cycle Implementation

Lecture 4: Floyd’s Algorithm

Lecture 5: Floyd’s Implementation

Chapter 5: Shortest Path

Lecture 1: Problem Explanation

Lecture 2: Dijkstra’s Algorithm

Lecture 3: Dijkstra’s Implementation

Chapter 6: Maximum Flow

Lecture 1: Problem Explanation

Lecture 2: Solving Max Flow

Lecture 3: Matrix Representation in Scala

Lecture 4: Find Path Implementation

Lecture 5: Max Flow Implementation

Instructors

Packt Publishing
Tech Knowledge in Motion

Rating Distribution

1 stars: 0 votes
2 stars: 3 votes
3 stars: 6 votes
4 stars: 13 votes
5 stars: 11 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu