Skip to contentOpens in a new tab

Modules Workshops

English

English සිංහලNot translated தமிழ்Not translated

Esc

All languages

↑↓navigate↵open⌘Jpreview

Modules
Workshops

Data Structures and Algorithms
- Foundations
  - Introduction to Data Structures and Algorithms
  - Computational Complexity Analysis
- Data Structures
  - Linear Structures
    Arrays - Fundamental Data Structure
    Linked List
    Stack - The LIFO Data Structure
    Introduction to Queues
  - Non-Linear Structures
    Tree Data Structures
    Red-Black Trees
    Graphs (Non-Linear Data Structure)
    Heaps
    Hash Tables
- Algorithms
  - Algorithm Topics
  - Graph Algorithms
    Graph Algorithms Overview
    BFS
    DFS
    Minimum Spanning Tree (Kruskal)
    Shortest Path (Dijkstra)
  - Searching
    Linear Search
    Binary Search
  - Sorting
    Simple Sorts
    Sorting (Simple)
    Bubble Sort
    Insertion Sort
    Selection Sort - The Minimalist Approach
    Advanced Sorts
    Sorting (Advanced)
    Merge Sort - The Divide and Conquer Champion
    Quick Sort
    Counting Sort
    Radix Sort
    Shell Sort
  - Algorithmic Techniques
    Backtracking
    Bit Manipulation
    Branch and Bound
    Divide and Conquer
    Dynamic Programming
    Geometric Algorithms
    Greedy Algorithms
    Hashing (Theory)
    Mathematical Algorithms
    Randomized Algorithms
    Recursion - The Art of Self-Reference
    String Algorithms
- Course Outlines
  - Data Structures and Algorithms Course Outline
  - Advanced Data Structures and Algorithms Course Outline

Data Structures and Algorithms
- Foundations
  - Introduction to Data Structures and Algorithms
  - Computational Complexity Analysis
- Data Structures
  - Linear Structures
    Arrays - Fundamental Data Structure
    Linked List
    Stack - The LIFO Data Structure
    Introduction to Queues
  - Non-Linear Structures
    Tree Data Structures
    Red-Black Trees
    Graphs (Non-Linear Data Structure)
    Heaps
    Hash Tables
- Algorithms
  - Algorithm Topics
  - Graph Algorithms
    Graph Algorithms Overview
    BFS
    DFS
    Minimum Spanning Tree (Kruskal)
    Shortest Path (Dijkstra)
  - Searching
    Linear Search
    Binary Search
  - Sorting
    Simple Sorts
    Sorting (Simple)
    Bubble Sort
    Insertion Sort
    Selection Sort - The Minimalist Approach
    Advanced Sorts
    Sorting (Advanced)
    Merge Sort - The Divide and Conquer Champion
    Quick Sort
    Counting Sort
    Radix Sort
    Shell Sort
  - Algorithmic Techniques
    Backtracking
    Bit Manipulation
    Branch and Bound
    Divide and Conquer
    Dynamic Programming
    Geometric Algorithms
    Greedy Algorithms
    Hashing (Theory)
    Mathematical Algorithms
    Randomized Algorithms
    Recursion - The Art of Self-Reference
    String Algorithms
- Course Outlines
  - Data Structures and Algorithms Course Outline
  - Advanced Data Structures and Algorithms Course Outline

Graph Algorithms

DFS

Implementation: DFS.java

Last updated on October 7, 2026

Was this page helpful?

Thanks for your feedback!

PreviousBFS NextMinimum Spanning Tree (Kruskal)

Open in chat

Open in ChatGPT Open in Claude Open in Cursor