The Baeldung logo
  • The Baeldung LogoCS Sublogo
  • Start Here
  • About ▼▲
    • Full Archive

      The high level overview of all the articles on the site.

    • About Baeldung

      About Baeldung.

Graph Theory

Learn how GPS systems find the shortest routes, how engineers design integrated circuits and what is graph colouring, and how it is used in the real world.

  • Binary Tree (28)
  • Cyclic Graphs (4)
  • Red-Black Trees (4)
  • Acyclic Graphs (3)
  • Hashing (2)
  • Prim (2)
  • reference (2)
  • DFS (2)

>> Image Processing: Graph-based Segmentation

>> Guide to Splay Trees

>> How Do Merkle Trees Work?

  • Hashing

>> Dominating Sets and Domination Numbers in Graph Theory

>> The Havel-Hakimi Algorithm

>> Level-order Traversal of Binary Tree

>> Introduction to K-D Trees

>> Node Degrees

>> Graph Theory: What Is Vertex Coloring?

>> What Are Multi-way Search Trees?

>> Difference Between Segment Trees, Interval Trees, Range Trees, and Binary Indexed Trees

>> What Are Tournament Graphs?

>> The Ternary Search Tree Data Structure

>> What Are Planar Graphs?

>> Finding Strongly Connected Components: Kosaraju’s Algorithm

>> How to Root a Tree?

>> Eccentricity, Radius, Diameter, Center, and Periphery

>> What Are Bridges in a Graph?

>> The Ramsey Theory

>> What Are Perfect Graphs?

>> Skip List Comparison with Binary Search Tree

>> Disjoint Set Union Data Structure

>> Isomorphic Trees

>> The Centers of Unweighted Trees

>> Quadtrees and Octrees

>> Practical Applications of Directed Acyclic Graphs

>> From Postfix Expressions to Expression Trees

>> Finding the Shortest Cycle in an Undirected Graph

>> Difference Between Tree Order and Degree

>> Storing a Tree Structure in a Relational Database

>> Binary Search Trees vs. AVL Trees: the Complexity of Construction

>> Find the Kth Smallest Element in a Binary Search Tree

>> Red-Black Tree vs. AVL Tree

>> Binary Tree vs. Binary Search Tree

>> Graph Theory: Path vs. Cycle vs. Circuit

>> Graph Adjacency and Incidence

>> Tree Edit Distance

>> Graph Density

>> Applications of Red-Black Trees

>> B-tree Data Structure

>> Balanced Trees

>> Induced Subgraphs

>> Weighted vs. Unweighted Graphs

>> Prim’s Algorithm

>> Rank of a Node in a Binary Search Tree

>> Finding the In-Order Successor of a Node

>> From Lists to Forests

>> Hashing a Tree Structure

  • Hashing

>> Real World Examples of Tree Structures

>> Segment Tree and Its Applications

>> How Is a Minimum Bottleneck Spanning Tree Different from a Minimum Spanning Tree?

>> Binary Search Tree with Strings

>> Finding Maximum Size Square in a Matrix Filled With Ones

>> Merging Two Binary Search Trees

>> Number of Nodes in a Binary Tree With Level N

>> Minimum Number of Steps to Reduce Number to One

>> Print All Paths With a Given Sum in a Binary Tree

>> Applications of Binary Trees

>> Generalized Suffix Trees

>> Finding the Shortest Path in a Graph Visiting All Nodes

>> Serialize and Deserialize a Binary Tree

>> Obtaining the Path in the Uniform Cost Search Algorithm

>> Finding the Lowest Common Ancestor in a Directed Acyclic Graph

>> What Is the Time Complexity of Tree Traversal?

>> Minimum Cut on a Graph Using a Maximum Flow Algorithm

>> Complexity of Inserting N Numbers into a Binary Search Tree

>> Calculating the Height of a Binary Tree

>> Time Complexity of Searching in a Balanced Binary Search Tree

>> Max-Heapify A Binary Tree

>> Heap vs Binary Search Tree

>> Minimum Spanning Tree: The Cut Property

>> Complete Binary Tree Vs Almost Complete Binary Tree

>> What is an Augmenting Path?

>> Using Leaf Count to Find Total Number of Nodes in a Full K-Ary Tree

>> Height of a Balanced Tree

>> Time and Space Complexity of Adjacency Matrix and List

>> Determine Whether Two Nodes in a Graph Are Connected

>> Graphs: Sparse vs Dense

>> Reconstructing a Tree From Its Depth-First Traversals

>> How to Validate a Binary Search Tree?

>> Create Balanced Binary Search Tree From Sorted List

>> How to Check If a Binary Tree Is Symmetric?

>> Lowest Common Ancestor of Two Nodes in a Tree

>> Sorting the Elements in a Binary Tree

>> Introduction to the Binary Tree Data Structure

>> How to Find Total Number of Minimum Spanning Trees in a Graph?

>> Self-Balancing Binary Search Trees

>> Detecting Cycles in a Directed Graph

>> Topological Sort of Directed Acyclic Graph

>> Introduction to Graph Theory

>> How to Build a Knowledge Graph?

>> Finding Articulation Points of a Graph

>> Introduction to Red-Black Trees

>> Differences Between Tree Structures

>> Kruskal’s vs Prim’s Algorithm

>> What Is an Incident Edge?

>> Determine Maximum Number of Edges in a Directed Graph

>> How to Find If a Graph Is Bipartite?

>> What Is the Difference Between a Directed and an Undirected Graph

>> Shortest Path to Certain Nodes in a Graph

>> A Quick Guide to Binary Search Trees

>> Determining Whether a Directed or Undirected Graph Is a Tree

>> Finding the Lowest Common Ancestor of Two Nodes in a Binary Tree

>> Finding the Maximum-Minimum Capacity For a Node in a Graph

>> Minimum Spanning Tree Vs Shortest Path Tree

>> Tries (Prefix Trees)

>> Connected Components in a Graph

>> The Difference Between B-trees and B+trees

>> Difference Between Tree Depth and Height

>> Cycles in an Undirected Graph

>> Graph Data Structures

>> Common and Useful Data Structures

  • ↑ Back to Top
The Baeldung logo

Categories

  • Algorithms
  • Artificial Intelligence
  • Core Concepts
  • Data Structures
  • Graph Theory
  • Latex
  • Networking
  • Security

Series

About

  • About Baeldung
  • The Full archive
  • Editors
  • Terms of Service
  • Privacy Policy
  • Company Info
  • Contact
The Baeldung Logo