This course teaches learners how to use graph data structures in Java, covering topics such as graph traversal, DFS, BFS, and Dijkstra's Algorithm. By the end of the course, students will be able to implement and work with graph algorithms. The teaching method includes graphical explanations and code implementations. This course is designed for beginners who are interested in learning about graph algorithms and data structures using Java.
Overview
Syllabus
⌨️ Introduction to Graphs
⌨️ Graphical Explanation
⌨️ Code Implementation
⌨️ Vertex class
⌨️ Edge class
⌨️ Graph class
⌨️ main method
⌨️ compile and run
⌨️ Introduction to Graph Traversals
⌨️ Traversal Orders
⌨️ DFS Traversal Graphical Explanation
⌨️ Code Implementation of DFS
⌨️ BFS Traversal Graphical Explanation
⌨️ Code Implementation of BFS
⌨️ Compile and Run
⌨️ Introduction to Dijkstra's Algorithm
⌨️ Graphical Explanation
⌨️ Code Implementation
⌨️ Priority Queue
⌨️ Iterating through the vertices
⌨️ while loop
⌨️ helper method
⌨️ compile and run
⌨️ problem occurred
⌨️ shortestPathBetween
⌨️ fix to the problem
⌨️ Successful Compile and Run
Taught by
freeCodeCamp.org
