---
title: "Discussion on \"Minimum Spanning Tree Problem (Java an\" | Hashnode"
description: "Discussion on \"Minimum Spanning Tree Problem (Java an\". In Kruskal Algorithm, initially, all the nodes of the graph are separated from each other, which means they don’t have an edge between them. Then to obtain the minimum spanning tree from that graph we first sort the edges of the graph in a non-decrea..."
url: "https://hashnode.com/posts/minimum-spanning-tree-problem/615ef87db945c81a907ce87e"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Minimum Spanning Tree Problem (Java an](https://roundthetech.hashnode.dev/minimum-spanning-tree-problem?utm_source=hashnode&utm_medium=feed)

In Kruskal Algorithm, initially, all the nodes of the graph are separated from each other, which means they don’t have an edge between them. Then to obtain the minimum spanning tree from that graph we first sort the edges of the graph in a non-decrea...

Oct 7, 2021 · 3 min read · roundthetech.hashnode.dev  
Updated Apr 11, 2022  
Read the article

-   [#cpp](https://hashnode.com/tag/cpp)
-   [#java](https://hashnode.com/tag/java)
-   [#python](https://hashnode.com/tag/python)

## Written by

[Arjun Kumar](https://hashnode.com/@arjnkmr)

@arjnkmr

  
[View profile](https://hashnode.com/@arjnkmr)

Tech Matters

## Responses 1

Markdown supported · ⌘↵ to post

No responses yet.
