Skip to main content
C C++ Java Python PHP C# HTML CSS JavaScript Bootstrap Node.js Express.js React.js Next.js Tailwind TypeScript Dart Angular Vue.js Spring Boot Django Flask ASP.NET Material UI Chakra UI Sass MongoDB MySQL Oracle C C++ Java Python PHP C# HTML CSS JavaScript Bootstrap Node.js Express.js React.js Next.js Tailwind TypeScript Dart Angular Vue.js Spring Boot Django Flask ASP.NET Material UI Chakra UI Sass MongoDB MySQL Oracle
SQL Server Firebase PostgreSQL MariaDB Swift Kotlin React Native R Julia Scala NLP ML DP NN Gen AI JUnit Jest Pytest Selenium Cypress AWS Azure Google Cloud Stack Queue Linked List Trees Graphs SQL Server Firebase PostgreSQL MariaDB Swift Kotlin React Native R Julia Scala NLP ML DP NN Gen AI JUnit Jest Pytest Selenium Cypress AWS Azure Google Cloud Stack Queue Linked List Trees Graphs
Advanced 14 planned topics Algorithms

Introduction to Graphs

Learn graph representations, BFS, and DFS. Free graphs introduction for algorithms.

Learning Outcomes

  • Represent a graph as a list of edges or adj lists
  • Run BFS and DFS on a small example
  • Detect a cycle at a high level
  • Choose list versus matrix for density

Overview

Graphs model networks: cities, friendships, and dependencies. You store them as adjacency lists or matrices.

This introduction covers directed versus undirected graphs and the two core searches.

Shortest paths and topological sort follow later.

What this course will cover

  1. 1. Representations
  2. 2. BFS
  3. 3. DFS
  4. 4. Directed graphs
  5. 5. Cycle idea
  6. 6. Practice

Start a complete tutorial now

Full 6-level lessons are live for C, C++, Java, Python, and JavaScript. Use them while the remaining Graphs lessons are added.

← All technology tutorials