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.

Category upGraph Theory

Trees » Kruskal

In graph theory, a tree is a graph where two nodes are connected by one edge. Trees are a simple graph form because there are no cycles. Despite this, trees are used to solve various problems in computer science.

  • Binary Tree (30)
  • Red-Black Trees (4)
  • DFS (3)
  • Hashing (2)
  • x Kruskal (2)
  • Databases (2)
  • Prim (2)
  • reference (2)
  • BFS (2)

>> Disjoint Set Union Data Structure

>> Kruskal’s vs Prim’s Algorithm

  • ↑ 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