Skip to content
Theory of Coding

Theory of Coding

Search
  • Home
  • Data Structures
    • Graphs
      • Graph Theory Basics
      • Breadth First Search Algorithm
      • Snakes and Ladders Game Code
      • Depth First Search Algorithm
      • Bellman Ford Algorithm
      • Prim’s Algorithm
      • Dijkstra’s Algorithm
    • Trees
      • Binary Indexed Tree (or) Fenwick Tree
      • Trie Tree
      • Compressed Trie Tree
      • N-ary tree or K-way tree data structure
      • Segment Trees
      • Binary Heaps
      • Binary Heaps and Heapsort Algorithm
  • Algorithms
    • Searching & Sorting
      • Binary Search
      • Jump Search
      • Quick Sort
      • Merge Sort
    • Dynamic Programming
      • Introduction and Fibonacci Numbers
      • Kadane’s Algorithm
      • Edit Distance
    • Math
      • Modular Arithmetic Properties
  • AI
    • MiniMax Algorithm
    • Minimax algorithm with Alpha-Beta Pruning
    • Iterative Deepening Depth First Search
    • Bidirectional Search
  • Java
    • Language Basics
      • An Introduction
      • Data Types, Input and Operators
      • If Else, Switch and Loops
      • Strings, StringBuffer and StringBuilder
      • Arrays in Java
      • Enum and Methods in Java
    • Introduction to OOP
      • Java Tutorials – Classes and Objects
      • Encapsulation in Java
      • Constructor and Overloading Methods
      • Inheritance
Theory of Coding

Theory of Coding

Close menu
  • Home
  • Data Structures
    • Graphs
      • Graph Theory Basics
      • Breadth First Search Algorithm
      • Snakes and Ladders Game Code
      • Depth First Search Algorithm
      • Bellman Ford Algorithm
      • Prim’s Algorithm
      • Dijkstra’s Algorithm
    • Trees
      • Binary Indexed Tree (or) Fenwick Tree
      • Trie Tree
      • Compressed Trie Tree
      • N-ary tree or K-way tree data structure
      • Segment Trees
      • Binary Heaps
      • Binary Heaps and Heapsort Algorithm
  • Algorithms
    • Searching & Sorting
      • Binary Search
      • Jump Search
      • Quick Sort
      • Merge Sort
    • Dynamic Programming
      • Introduction and Fibonacci Numbers
      • Kadane’s Algorithm
      • Edit Distance
    • Math
      • Modular Arithmetic Properties
  • AI
    • MiniMax Algorithm
    • Minimax algorithm with Alpha-Beta Pruning
    • Iterative Deepening Depth First Search
    • Bidirectional Search
  • Java
    • Language Basics
      • An Introduction
      • Data Types, Input and Operators
      • If Else, Switch and Loops
      • Strings, StringBuffer and StringBuilder
      • Arrays in Java
      • Enum and Methods in Java
    • Introduction to OOP
      • Java Tutorials – Classes and Objects
      • Encapsulation in Java
      • Constructor and Overloading Methods
      • Inheritance
Theory of Coding

Theory of Coding

Search Toggle menu

Tag: Adjacency List

31 December 2017Graph Theory

Adjacency List with String vertices using C++ STL

Hello people..! This is a special extension for my discussion on Graph Theory Basics. Here, I give you the code for implementing […]

19 January 201513 November 2023Graph Theory

Bellman Ford Algorithm

Hello people…! In this post I will talk about another single source shortest path algorithm, the Bellman Ford Algorithm. Unlike Dijkstra’s Algorithm, […]

11 January 201512 December 2023Graph Theory

Dijkstra’s Algorithm

Hello, people…! In this post, I will talk about one of the fastest single source shortest path algorithms, which is, the Dijkstra’s Algorithm. […]

26 December 201411 November 2023Graph Theory

Depth First Search Algorithm

Hello people…! In this post I will talk about the other Graph Search Algorithm, the Depth First Search Algorithm. Depth First Search […]

25 December 201411 November 2023Graph Theory

Snakes and Ladders Game Code

Note – Theory of Coding is also on YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=a3_QGPthIDU Hoping you’ll support […]

25 December 201410 November 2023Graph Theory

Breadth First Search Algorithm

Note – Theory of Coding is also on YouTube! This post has a video. Watch it at – https://www.youtube.com/watch?v=5mG-qBRhvKQ Hoping you’ll support […]

24 December 201419 January 2025Graph Theory

Graph Theory Basics

Hello people…! In this post, I will talk about Graph Theory Basics, what are its terminologies, types and implementations in C. Graphs […]

Recent Posts

  • Bidirectional Search
  • Iterative Deepening Depth First Search (IDDFS)
  • N-ary tree or K-way tree data structure
  • Rotate matrix clockwise
  • Print matrix in spiral order

Categories

  • Array Interview Questions
  • Artificial Intelligence
  • C++ Tutorials
  • Competitive Coding
  • Dynamic Programming
  • Graph Theory
  • Heaps
  • Java
  • Math
  • Searching Algorithms
  • Sorting Algorithms
  • Tree Data Structures
© 2025 Theory of Coding. Proudly powered by Sydney