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

Java SE 13    |    Intermediate
  • 19 Videos | 1h 58m 11s
  • Includes Assessment
  • Earns a Badge
Likes 9 Likes 9
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

  • Playable
    1. 
    Course Overview
    1m 54s
    UP NEXT
  • Playable
    2. 
    Introducing Graphs
    4m 28s
  • Locked
    3. 
    Directed and Undirected Graphs
    3m 27s
  • Locked
    4. 
    Graphs and Trees
    5m 41s
  • Locked
    5. 
    Weighted Graphs
    2m 58s
  • Locked
    6. 
    Adjacency Matrix
    7m 37s
  • Locked
    7. 
    Adjacency List
    5m 24s
  • Locked
    8. 
    Adjacency Set
    4m 40s
  • Locked
    9. 
    Representing Graphs Using an Adjacency Matrix
    9m 12s
  • Locked
    10. 
    Adjacency Matrix Graph: Operations
    3m 42s
  • Locked
    11. 
    Adjacency Matrix Graph: Directed and Undirected
    7m
  • Locked
    12. 
    Adjacency Matrix Graph: Weighted Graphs
    4m 14s
  • Locked
    13. 
    Representing Graphs Using an Adjacency List
    9m 18s
  • Locked
    14. 
    Adjacency List Graph: Weighted Graphs
    8m 30s
  • Locked
    15. 
    Representing Graphs Using an Adjacency Set
    4m 19s
  • Locked
    16. 
    Graph Traversal
    6m 28s
  • Locked
    17. 
    Breadth-first Traversal
    10m
  • Locked