Advanced Data Structures & Algorithms in Java: Getting Started with Graphs

Java    |    Intermediate
  • 19 videos | 1h 49m 41s
  • Includes Assessment
  • Earns a Badge
Rating 4.8 of 8 users Rating 4.8 of 8 users (8)
Graph data structures have numerous real-world applications. Recognizing what these applications are and how best to work with graphs in your day-to-day is a must-have skill for any Software Engineer. In this course, you'll identify what is meant by a graph. You'll examine the typical, real-life applications of graphs and explore how they can be represented in programming languages. You'll move on to define different types of graphs, such as directed and undirected graphs, connected graphs, trees, and weighted and unweighted graphs. Next, you'll explore how to write code and perform operations on graphs. Finally, you'll implement graph representations in code using the adjacency matrix representation, the adjacency list, and adjacency set representation.

WHAT YOU WILL LEARN

  • Discover the key concepts covered in this course
    Define the structure and components of a graph
    Recognize directed and undirected graphs and their use cases
    Recognize the similarities between graphs and trees
    Explain weighted graphs and their use cases
    Describe how a graph can be represented as an adjacency matrix
    Define the adjacency list representation of a graph
    Contrast the adjacency set representation with the adjacency list
    Write code to represent graphs using an adjacency matrix
    Perform operations on an adjacency matrix graph
  • Represent directed and undirected graphs using an adjacency matrix
    Represent weighted graphs using an adjacency matrix
    Write code to represent graphs using an adjacency list
    Restructure code to allow weighted graph representations
    Write code to represent graphs using an adjacency set
    Understand how graph traversal techniques work
    Perform breadth-first traversal on a graph
    Perform depth-first traversal on a graph
    Summarize the key concepts covered in this course

IN THIS COURSE

  • 1m 54s
  • 4m 28s
    In this video, you will learn how to define the structure and components of a graph. FREE ACCESS
  • Locked
    3.  Directed and Undirected Graphs
    3m 27s
    After completing this video, you will be able to recognize directed and undirected graphs and their uses. FREE ACCESS
  • Locked
    4.  Graphs and Trees
    5m 41s
    Upon completion of this video, you will be able to recognize the similarities between graphs and trees. FREE ACCESS
  • Locked
    5.  Weighted Graphs
    2m 58s
    After completing this video, you will be able to explain weighted graphs and their use cases. FREE ACCESS
  • Locked
    6.  Adjacency Matrix
    7m 37s
    Upon completion of this video, you will be able to describe how a graph can be represented using an adjacency matrix. FREE ACCESS
  • Locked
    7.  Adjacency List
    5m 24s
    In this video, you will learn how to define the adjacency list representation of a graph. FREE ACCESS
  • Locked
    8.  Adjacency Set
    4m 40s
    In this video, find out how to compare and contrast the adjacency set representation with the adjacency list. FREE ACCESS
  • Locked
    9.  Representing Graphs Using an Adjacency Matrix
    9m 12s
    In this video, you will learn how to write code to represent graphs using an adjacency matrix. FREE ACCESS
  • Locked
    10.  Adjacency Matrix Graph: Operations
    3m 42s
    In this video, learn how to perform operations on a graph with an adjacency matrix. FREE ACCESS
  • Locked
    11.  Adjacency Matrix Graph: Directed and Undirected
    7m
    Learn how to represent directed and undirected graphs using an adjacency matrix. FREE ACCESS
  • Locked
    12.  Adjacency Matrix Graph: Weighted Graphs
    4m 14s
    In this video, you will learn how to represent weighted graphs using an adjacency matrix. FREE ACCESS
  • Locked
    13.  Representing Graphs Using an Adjacency List
    9m 18s
    In this video, find out how to write code to represent graphs using an adjacency matrix. FREE ACCESS
  • Locked
    14.  Adjacency List Graph: Weighted Graphs
    8m 30s
    In this video, learn how to restructure code to allow weighted graph representations. FREE ACCESS
  • Locked
    15.  Representing Graphs Using an Adjacency Set
    4m 19s
    In this video, learn how to write code to represent graphs using an adjacency list. FREE ACCESS
  • Locked
    16.  Graph Traversal
    6m 28s
    After completing this video, you will be able to understand how graph traversal techniques work. FREE ACCESS
  • Locked
    17.  Breadth-first Traversal
    10m
    In this video, you will learn how to perform a breadth-first traversal on a graph. FREE ACCESS
  • Locked
    18.  Depth-first Traversal
    9m 18s
    During this video, you will learn how to perform a depth-first traversal on a graph. FREE ACCESS
  • Locked
    19.  Course Summary
    1m 32s

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

Course Data Structures & Algorithms in Java: Introduction
Rating 4.5 of 100 users Rating 4.5 of 100 users (100)
Course Collections in Java: Sets & Maps
Rating 4.6 of 62 users Rating 4.6 of 62 users (62)
Course Control Structures in Java: Implementing Java Control Structures
Rating 4.5 of 75 users Rating 4.5 of 75 users (75)

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Course Advanced Data Structures & Algorithms in Java: Working with Graph Algorithms
Rating 4.6 of 14 users Rating 4.6 of 14 users (14)
Course Java Spring Cloud: Introduction to Microservices
Rating 4.5 of 204 users Rating 4.5 of 204 users (204)
Course Advanced Data Structures & Algorithms in Java: Working with the Binary Heap
Rating 4.6 of 15 users Rating 4.6 of 15 users (15)