# Advanced Data Structures & Algorithms in Java: Working with Graph Algorithms

Java    |    Intermediate
• 13 videos | 1h 32m 50s
• Includes Assessment
Rating 4.6 of 14 users (14)
To effectively work with graphs in your daily software engineering operations, you need to expand your knowledge beyond a basic familiarity. To do this, you need to identify which algorithms are used for which tasks and how to implement these algorithms using the Java programming language. In this course, you'll identify how graph nodes can be sorted using the topological sort algorithm, which has many real-life applications, such as course scheduling, as well as modeling tasks and dependencies. Next, you'll explore shortest path algorithms, which are used in mapping applications. You'll move on to identify and implement the shortest path in an unweighted graph. Finally, you'll implement Dijkstra's algorithm to find the shortest path in a weighted graph.

## WHAT YOU WILL LEARN

• Discover the key concepts covered in this course Explain what is meant by the topological sorting of graph nodes Describe the topological sorting algorithm Write code to implement topological sort Design a graph representation of courses and perform topological sort Explain the shortest path algorithm for unweighted graphs Populate the distance table and perform backtracking
• Write code to implement the shortest path algorithm Contrast the algorithms for shortest path in unweighted and weighted graphs Identify when the shortest path to a node needs to be updated Describe dijkstra's algorithm for the shortest path in a weighted graph Write code to implement dijkstra's algorithm Summarize the key concepts covered in this course

## IN THIS COURSE

• After completing this video, you will be able to explain what is meant by the topological sorting of graph nodes.
• 3.  The Topological Sort Algorithm
Upon completion of this video, you will be able to describe the topological sorting algorithm.
• 4.  Implementing Topological Sort
In this video, learn how to write code to implement a topological sort.
• 5.  Course Scheduling Using Topological Sort
During this video, you will learn how to design a graph representation of courses and perform a topological sort.
• 6.  The Shortest Path Algorithm
After completing this video, you will be able to explain the shortest path algorithm for unweighted graphs.
• 7.  Populating the Distance Table and Backtracking
In this video, you will learn how to populate the distance table and perform backtracking.
• 8.  Implementing Shortest Path in an Unweighted Graph
In this video, you will learn how to write code to implement the shortest path algorithm.
• 9.  Dijkstra's Algorithm
In this video, learn how to contrast the algorithms for the shortest path in unweighted and weighted graphs.
• 10.  Shortest Path in a Weighted Graph: Relaxation
In this video, learn how to identify when the shortest path to a node needs to be updated.
• 11.  Dijkstra's Algorithm to Find the Shortest Path
After completing this video, you will be able to describe Dijkstra's algorithm for finding the shortest path in a weighted graph.
• 12.  Implementing Dijkstra's Algorithm
In this video, you will write code to implement Dijkstra's algorithm.
• 13.  Course Summary

## EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.

Digital badges are yours to keep, forever.