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

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

• 1.
Course Overview
• 2.
Introducing Graphs
• 3.
Directed and Undirected Graphs
• 4.
Graphs and Trees
• 5.
Weighted Graphs
• 6.
• 7.
• 8.
• 9.
Representing Graphs Using an Adjacency Matrix
• 10.
• 11.
Adjacency Matrix Graph: Directed and Undirected
• 12.