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

Java    |    Intermediate
  • 13 videos | 1h 32m 50s
  • Includes Assessment
  • Earns a Badge
Rating 4.6 of 14 users 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

  • 1m 57s
  • 6m 40s
    After completing this video, you will be able to explain what is meant by the topological sorting of graph nodes. FREE ACCESS
  • Locked
    3.  The Topological Sort Algorithm
    4m
    Upon completion of this video, you will be able to describe the topological sorting algorithm. FREE ACCESS
  • Locked
    4.  Implementing Topological Sort
    10m 25s
    In this video, learn how to write code to implement a topological sort. FREE ACCESS
  • Locked
    5.  Course Scheduling Using Topological Sort
    7m 25s
    During this video, you will learn how to design a graph representation of courses and perform a topological sort. FREE ACCESS
  • Locked
    6.  The Shortest Path Algorithm
    8m 12s
    After completing this video, you will be able to explain the shortest path algorithm for unweighted graphs. FREE ACCESS
  • Locked
    7.  Populating the Distance Table and Backtracking
    6m 39s
    In this video, you will learn how to populate the distance table and perform backtracking. FREE ACCESS
  • Locked
    8.  Implementing Shortest Path in an Unweighted Graph
    11m 34s
    In this video, you will learn how to write code to implement the shortest path algorithm. FREE ACCESS
  • Locked
    9.  Dijkstra's Algorithm
    9m 14s
    In this video, learn how to contrast the algorithms for the shortest path in unweighted and weighted graphs. FREE ACCESS
  • Locked
    10.  Shortest Path in a Weighted Graph: Relaxation
    4m 11s
    In this video, learn how to identify when the shortest path to a node needs to be updated. FREE ACCESS
  • Locked
    11.  Dijkstra's Algorithm to Find the Shortest Path
    9m 17s
    After completing this video, you will be able to describe Dijkstra's algorithm for finding the shortest path in a weighted graph. FREE ACCESS
  • Locked
    12.  Implementing Dijkstra's Algorithm
    11m 35s
    In this video, you will write code to implement Dijkstra's algorithm. FREE ACCESS
  • 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 on some of our courses, which can be shared on any social network or business platform.

Digital badges are yours to keep, forever.

YOU MIGHT ALSO LIKE

Book Graph Algorithms for Data Science: With examples in Neo4j
Book Java: The Complete Reference, Thirteenth Edition
Journey Java Novice to Javanista
Rating 4.7 of 13 users Rating 4.7 of 13 users (13)

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Course The Spring Web MVC Framework: Building Web Applications & REST APIs
Rating 4.7 of 30 users Rating 4.7 of 30 users (30)
Course Advanced Data Structures & Algorithms in Java: Sorting & Searching Algorithms
Rating 4.6 of 50 users Rating 4.6 of 50 users (50)
Course Advanced Features in Java: Working with Maps in Java
Rating 4.4 of 50 users Rating 4.4 of 50 users (50)