Lets look into Minimum Spanning Trees(part 1) episode artwork

EPISODE · Mar 4, 2019 · 2 MIN

Lets look into Minimum Spanning Trees(part 1)

from Code Logic · host Sarvesh Bhatnagar

So, in this podcast we discuss about what connected graphs are , what trees are, how they differ from each other and how to convert a graph into a tree. So basically after getting a grasp on these basic concepts, we will try to understand how we can get a minimum spanning tree from a given connected graph.

So, in this podcast we discuss about what connected graphs are , what trees are, how they differ from each other and how to convert a graph into a tree. So basically after getting a grasp on these basic concepts, we will try to understand how we can get a minimum spanning tree from a given connected graph.

NOW PLAYING

Lets look into Minimum Spanning Trees(part 1)

0:00 2:47

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

From Gold To Code

Jun 29, 2025 ·3m

Circles

May 15, 2025 ·4m

Sovereign City

May 15, 2025 ·4m

Shadow Dreams

May 15, 2025 ·4m

Man in the Middle

May 15, 2025 ·3m

Frequently Asked Questions

How long is this episode of Code Logic?

This episode is 2 minutes long.

When was this Code Logic episode published?

This episode was published on March 4, 2019.

What is this episode about?

So, in this podcast we discuss about what connected graphs are , what trees are, how they differ from each other and how to convert a graph into a tree. So basically after getting a grasp on these basic concepts, we will try to understand how we can...

Can I download this Code Logic episode?

Yes, you can download this episode by clicking the download button on the episode player, or subscribe to the podcast in your preferred podcast app for automatic downloads.
URL copied to clipboard!