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

Java SE 13    |    Intermediate
  • 13 Videos | 1h 38m 20s
  • Includes Assessment
  • Earns a Badge
Likes 2 Likes 2
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

  • Playable
    1. 
    Course Overview
    1m 57s
    UP NEXT
  • Playable
    2. 
    Introducing Topological Sort
    6m 40s
  • Locked
    3. 
    The Topological Sort Algorithm
    4m
  • Locked
    4. 
    Implementing Topological Sort
    10m 25s
  • Locked
    5. 
    Course Scheduling Using Topological Sort
    7m 25s
  • Locked
    6. 
    The Shortest Path Algorithm
    8m 12s
  • Locked
    7. 
    Populating the Distance Table and Backtracking
    6m 39s
  • Locked
    8. 
    Implementing Shortest Path in an Unweighted Graph
    11m 34s
  • Locked
    9. 
    Dijkstra's Algorithm
    9m 14s
  • Locked
    10. 
    Shortest Path in a Weighted Graph: Relaxation
    4m 11s
  • Locked
    11. 
    Dijkstra's Algorithm to Find the Shortest Path
    9m 17s
  • Locked
    12. 
    Implementing Dijkstra's Algorithm
    11m 35s
  • Locked
    13. 
    Course Summary
    1m 41s

EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

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

Digital badges are yours to keep, forever.