The Baeldung logo
  • The Baeldung LogoCS SublogoCS Sublogo
  • Start Here
  • Guides ▼▲
    • Core Concepts

      Fundamental concepts in Computer Science

    • Operating Systems

      Learn about the types of OSs used and the basic services they provide.

    • Artificial Intelligence

      Explore the concepts and algorithms at the foundation of modern artificial intelligence

    • Graph Theory

      Learn how GPS systems find the shortest routes, how engineers design integrated circuits and more real-world uses of graphs

    • Latex

      A powerful preparation tool for creating high-quality document.

  • About ▼▲
    • Full Archive

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

    • About Baeldung

      About Baeldung.

Category upAlgorithms

Graph Traversal

  • Binary Tree (6)
  • DFS (5)
  • Prim (4)
  • Dijkstra (4)
  • BFS (3)
  • Kruskal (2)

>> Prim’s Algorithm

  • reference

>> Minimax Algorithm

  • reference

>> Depth-First Search vs. Breadth-First Search

  • reference

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

>> Why Can’t Prim’s or Kruskal’s Algorithms Be Used on a Directed Graph?

>> Rank of a Node in a Binary Search Tree

>> Finding the In-Order Successor of a Node

>> Graph Search vs. Tree-Like Search

>> Uniform-Cost Search vs. Best-First Search

>> Beam Search Algorithm

  • ↑ Back to Top
  • 1
  • 2
  • 3
  • Next →
The Baeldung logo

Categories

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

Series

  • Graphs Tutorial
  • Neural Networks Series
  • LaTeX Series

About

  • About Baeldung
  • Baeldung All Access
  • The Full archive
  • Editors
  • Our Partners
  • Partner with Baeldung
  • eBooks
  • FAQ
  • Baeldung Pro
  • Terms of Service
  • Privacy Policy
  • Company Info
  • Contact
The Baeldung Logo